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-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:24:27,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:24:27,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:24:27,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:24:27,267 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:24:27,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:24:27,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:24:27,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:24:27,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:24:27,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:24:27,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:24:27,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:24:27,279 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:24:27,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:24:27,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:24:27,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:24:27,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:24:27,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:24:27,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:24:27,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:24:27,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:24:27,305 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:24:27,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:24:27,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:24:27,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:24:27,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:24:27,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:24:27,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:24:27,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:24:27,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:24:27,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:24:27,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:24:27,319 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:24:27,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:24:27,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:24:27,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:24:27,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:24:27,344 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:24:27,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:24:27,345 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:24:27,345 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:24:27,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:24:27,345 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:24:27,345 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:24:27,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:24:27,346 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:24:27,346 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:24:27,346 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:24:27,346 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:24:27,347 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:24:27,347 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:24:27,347 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:24:27,348 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:24:27,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:24:27,348 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:24:27,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:24:27,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:24:27,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:24:27,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:24:27,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:24:27,349 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:24:27,349 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:24:27,350 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:24:27,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:24:27,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:24:27,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:24:27,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:24:27,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:24:27,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:24:27,351 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:24:27,351 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:24:27,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:24:27,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:24:27,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:24:27,352 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:24:27,352 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:24:27,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:24:27,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:24:27,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:24:27,410 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:24:27,410 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:24:27,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-03-04 16:24:27,412 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-03-04 16:24:27,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:24:27,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:24:27,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:27,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:24:27,460 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:24:27,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:27,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:24:27,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:24:27,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:24:27,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... [2019-03-04 16:24:27,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:24:27,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:24:27,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:24:27,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:24:27,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:24:27,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:24:27,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:24:27,875 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:24:27,876 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-03-04 16:24:27,877 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:27 BoogieIcfgContainer [2019-03-04 16:24:27,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:24:27,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:24:27,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:24:27,881 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:24:27,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:27" (1/2) ... [2019-03-04 16:24:27,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f60d848 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:24:27, skipping insertion in model container [2019-03-04 16:24:27,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:27" (2/2) ... [2019-03-04 16:24:27,885 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-03-04 16:24:27,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:24:27,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-03-04 16:24:27,919 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-03-04 16:24:27,957 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:24:27,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:24:27,959 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:24:27,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:24:27,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:24:27,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:24:27,960 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:24:27,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:24:27,960 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:24:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-03-04 16:24:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:24:27,996 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:27,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:24:28,001 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:28,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-03-04 16:24:28,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:28,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:28,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:28,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:28,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:28,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:28,245 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-03-04 16:24:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:28,473 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-03-04 16:24:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:28,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:24:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:28,489 INFO L225 Difference]: With dead ends: 29 [2019-03-04 16:24:28,489 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:24:28,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:24:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-03-04 16:24:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:24:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-03-04 16:24:28,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-03-04 16:24:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:28,531 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-03-04 16:24:28,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-03-04 16:24:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:28,532 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:28,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:28,533 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:28,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:28,533 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-03-04 16:24:28,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:28,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:28,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:28,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:28,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:28,720 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:24:28,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:28,926 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:28,927 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,951 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,050 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,132 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,216 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,301 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 21 treesize of output 24 [2019-03-04 16:24:29,319 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 24 treesize of output 26 [2019-03-04 16:24:29,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:29,353 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:29,375 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 30 treesize of output 32 [2019-03-04 16:24:29,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:29,533 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,575 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,595 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,623 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,722 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,746 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,890 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,891 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:30,158 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-03-04 16:24:30,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:30,175 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,263 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:30,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:30,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:30,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:30,337 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-03-04 16:24:30,675 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-03-04 16:24:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:30,928 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-03-04 16:24:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:30,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:30,930 INFO L225 Difference]: With dead ends: 47 [2019-03-04 16:24:30,930 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:24:30,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:24:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-03-04 16:24:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:24:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-03-04 16:24:30,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-03-04 16:24:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:30,939 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-03-04 16:24:30,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-03-04 16:24:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:30,940 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:30,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:30,941 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:30,942 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-03-04 16:24:30,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:30,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:30,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:30,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:30,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:31,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:31,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:24:31,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:31,040 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 21 treesize of output 24 [2019-03-04 16:24:31,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,052 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 24 treesize of output 26 [2019-03-04 16:24:31,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,070 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 26 treesize of output 28 [2019-03-04 16:24:31,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:31,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:24:31,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,311 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:31,312 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,326 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,353 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,408 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,426 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,454 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:31,576 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,602 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,649 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,661 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,682 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,739 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:24:31,740 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:31,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:31,801 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,832 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:31,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-03-04 16:24:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:31,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:31,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:31,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:31,866 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 6 states. [2019-03-04 16:24:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:32,055 INFO L93 Difference]: Finished difference Result 37 states and 65 transitions. [2019-03-04 16:24:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:32,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:32,057 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:24:32,057 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:24:32,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:24:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-03-04 16:24:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:24:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 51 transitions. [2019-03-04 16:24:32,063 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 51 transitions. Word has length 3 [2019-03-04 16:24:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:32,064 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 51 transitions. [2019-03-04 16:24:32,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 51 transitions. [2019-03-04 16:24:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:32,064 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:32,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:32,065 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-03-04 16:24:32,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:32,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:32,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:32,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:32,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:32,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:32,200 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:24:32,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:32,233 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 21 treesize of output 24 [2019-03-04 16:24:32,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,288 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 24 treesize of output 26 [2019-03-04 16:24:32,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,299 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 26 treesize of output 28 [2019-03-04 16:24:32,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,324 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 28 treesize of output 30 [2019-03-04 16:24:32,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,351 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 30 treesize of output 32 [2019-03-04 16:24:32,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,391 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:24:32,391 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,406 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,421 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,436 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,451 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,469 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,570 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:24:32,571 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,592 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,607 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,620 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,637 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,668 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,717 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:32,717 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-03-04 16:24:32,765 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:24:32,766 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,887 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:24:32,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:24:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:32,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:32,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:32,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:32,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:32,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:32,968 INFO L87 Difference]: Start difference. First operand 20 states and 51 transitions. Second operand 6 states. [2019-03-04 16:24:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:33,335 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2019-03-04 16:24:33,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:24:33,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:33,338 INFO L225 Difference]: With dead ends: 38 [2019-03-04 16:24:33,338 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:24:33,338 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:24:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:24:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-03-04 16:24:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:24:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2019-03-04 16:24:33,345 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 3 [2019-03-04 16:24:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:33,345 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2019-03-04 16:24:33,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-03-04 16:24:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:33,346 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:33,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:33,346 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-03-04 16:24:33,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:33,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:33,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:33,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:33,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:33,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:24:33,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:33,459 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:33,460 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,474 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,599 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,798 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,855 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,882 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 21 treesize of output 24 [2019-03-04 16:24:33,887 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 24 treesize of output 26 [2019-03-04 16:24:33,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:33,917 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:33,951 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 30 treesize of output 32 [2019-03-04 16:24: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, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:34,027 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,037 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,048 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,065 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,130 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,141 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,174 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:34,174 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:34,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:34,247 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,300 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:34,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:34,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:34,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:34,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:34,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:34,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:34,356 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 6 states. [2019-03-04 16:24:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:34,586 INFO L93 Difference]: Finished difference Result 48 states and 93 transitions. [2019-03-04 16:24:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:34,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:34,587 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:24:34,588 INFO L226 Difference]: Without dead ends: 46 [2019-03-04 16:24:34,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-03-04 16:24:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 23. [2019-03-04 16:24:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:24:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2019-03-04 16:24:34,596 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 65 transitions. Word has length 3 [2019-03-04 16:24:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:34,596 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 65 transitions. [2019-03-04 16:24:34,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 65 transitions. [2019-03-04 16:24:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:34,597 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:34,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:34,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash 941032, now seen corresponding path program 1 times [2019-03-04 16:24:34,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:34,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:34,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:34,680 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:24:34,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:34,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:34,703 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:34,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:34,715 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 21 treesize of output 24 [2019-03-04 16:24:34,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,729 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:24:34,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,741 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 26 treesize of output 28 [2019-03-04 16:24:34,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,758 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 28 treesize of output 30 [2019-03-04 16:24:34,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,797 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 30 treesize of output 32 [2019-03-04 16:24:34,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:34,856 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,869 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,882 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,895 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,908 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,921 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,983 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:34,984 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,990 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,998 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,009 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,029 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,063 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,063 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:35,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:35,102 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,133 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,133 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:35,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:24:35,272 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,294 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,295 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:24:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:35,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:35,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:35,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:35,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:35,384 INFO L87 Difference]: Start difference. First operand 23 states and 65 transitions. Second operand 8 states. [2019-03-04 16:24:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:35,756 INFO L93 Difference]: Finished difference Result 54 states and 135 transitions. [2019-03-04 16:24:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:35,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:35,758 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:24:35,758 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:24:35,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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:24:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:24:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. [2019-03-04 16:24:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:24:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 108 transitions. [2019-03-04 16:24:35,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 108 transitions. Word has length 4 [2019-03-04 16:24:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:35,768 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 108 transitions. [2019-03-04 16:24:35,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 108 transitions. [2019-03-04 16:24:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:35,769 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:35,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:35,769 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-03-04 16:24:35,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:35,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:35,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:35,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:24:35,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:35,948 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 21 treesize of output 24 [2019-03-04 16:24:35,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,953 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 24 treesize of output 26 [2019-03-04 16:24:35,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:35,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:35,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,999 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 30 treesize of output 32 [2019-03-04 16:24:36,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,028 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:24:36,029 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,043 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,064 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,079 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,091 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,106 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,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:24:36,170 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,178 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,190 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,208 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,233 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,261 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,305 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:24:36,332 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:24:36,333 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,397 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,398 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:24:36,462 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:24:36,463 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,495 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:24:36,496 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:24:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:36,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:36,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:36,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:36,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:36,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:36,538 INFO L87 Difference]: Start difference. First operand 29 states and 108 transitions. Second operand 8 states. [2019-03-04 16:24:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:37,988 INFO L93 Difference]: Finished difference Result 64 states and 151 transitions. [2019-03-04 16:24:37,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:37,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:37,991 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:24:37,991 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:24:37,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:24:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2019-03-04 16:24:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:24:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 107 transitions. [2019-03-04 16:24:38,002 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 107 transitions. Word has length 4 [2019-03-04 16:24:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:38,002 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 107 transitions. [2019-03-04 16:24:38,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 107 transitions. [2019-03-04 16:24:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:38,003 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:38,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:38,003 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-03-04 16:24:38,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:38,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:38,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:38,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:38,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,129 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:38,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:38,141 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 21 treesize of output 24 [2019-03-04 16:24:38,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,146 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 24 treesize of output 26 [2019-03-04 16:24:38,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:38,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:38,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,203 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 30 treesize of output 32 [2019-03-04 16:24:38,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,489 INFO L301 Elim1Store]: Index analysis took 251 ms [2019-03-04 16:24:38,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:38,911 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,924 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,938 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,953 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,969 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,984 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:39,049 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,053 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,063 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,075 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,096 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,133 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,133 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:39,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:39,220 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,250 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,251 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:39,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:24:39,300 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,332 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,332 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:46 [2019-03-04 16:24:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:39,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:39,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:39,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:39,414 INFO L87 Difference]: Start difference. First operand 31 states and 107 transitions. Second operand 8 states. [2019-03-04 16:24:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:39,809 INFO L93 Difference]: Finished difference Result 63 states and 156 transitions. [2019-03-04 16:24:39,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:39,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:39,810 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:24:39,810 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:24:39,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:24:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 33. [2019-03-04 16:24:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:24:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 120 transitions. [2019-03-04 16:24:39,828 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 120 transitions. Word has length 4 [2019-03-04 16:24:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:39,829 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 120 transitions. [2019-03-04 16:24:39,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 120 transitions. [2019-03-04 16:24:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:39,830 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:39,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:39,830 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-03-04 16:24:39,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:39,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:39,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:39,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:39,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:24:39,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:39,936 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:39,937 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,946 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,958 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,968 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,986 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:24:40,014 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:24:40,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:40,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:40,032 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 30 treesize of output 32 [2019-03-04 16:24:40,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:40,089 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,099 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,111 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,122 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,134 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,145 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,177 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,178 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:40,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:40,218 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,246 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,246 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-03-04 16:24:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:40,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:40,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:40,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:40,289 INFO L87 Difference]: Start difference. First operand 33 states and 120 transitions. Second operand 6 states. [2019-03-04 16:24:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:40,474 INFO L93 Difference]: Finished difference Result 56 states and 146 transitions. [2019-03-04 16:24:40,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:40,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:40,476 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:24:40,476 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:24:40,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:24:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-03-04 16:24:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:24:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 128 transitions. [2019-03-04 16:24:40,485 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 128 transitions. Word has length 4 [2019-03-04 16:24:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:40,486 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 128 transitions. [2019-03-04 16:24:40,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 128 transitions. [2019-03-04 16:24:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:40,487 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:40,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:40,487 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:40,487 INFO L82 PathProgramCache]: Analyzing trace with hash 945248, now seen corresponding path program 1 times [2019-03-04 16:24:40,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:40,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:40,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:40,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:40,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:40,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:40,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:40,690 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:40,691 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,703 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,715 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,729 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,752 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,783 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 21 treesize of output 24 [2019-03-04 16:24:40,787 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 24 treesize of output 26 [2019-03-04 16:24:40,795 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:40,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:40,807 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 30 treesize of output 32 [2019-03-04 16:24:40,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:40,848 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,859 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,870 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,884 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,896 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,908 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,943 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,943 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:41,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:41,018 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,046 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,046 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:24:41,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:24:41,080 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,099 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,099 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:24:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:41,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:41,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:41,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:41,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:41,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:41,137 INFO L87 Difference]: Start difference. First operand 35 states and 128 transitions. Second operand 8 states. [2019-03-04 16:24:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:41,461 INFO L93 Difference]: Finished difference Result 74 states and 194 transitions. [2019-03-04 16:24:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:41,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:41,463 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:24:41,463 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:24:41,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:24:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 41. [2019-03-04 16:24:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:24:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 159 transitions. [2019-03-04 16:24:41,474 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 159 transitions. Word has length 4 [2019-03-04 16:24:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:41,474 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 159 transitions. [2019-03-04 16:24:41,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 159 transitions. [2019-03-04 16:24:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:41,475 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:41,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:41,476 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:41,476 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-03-04 16:24:41,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:41,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:41,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:41,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:41,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:24:41,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:41,667 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:24:41,668 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,674 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,679 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,694 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,715 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,744 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,778 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 21 treesize of output 24 [2019-03-04 16:24:41,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:24:41,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:41,793 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 28 treesize of output 30 [2019-03-04 16:24:41,798 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 30 treesize of output 32 [2019-03-04 16:24:41,802 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:24:41,803 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,815 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,827 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,839 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,851 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,863 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,907 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,907 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:24:41,931 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:24:41,932 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,973 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,974 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:24:42,015 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:24:42,015 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,048 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:24:42,048 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:24:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:42,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:42,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:42,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:42,089 INFO L87 Difference]: Start difference. First operand 41 states and 159 transitions. Second operand 8 states. [2019-03-04 16:24:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,691 INFO L93 Difference]: Finished difference Result 91 states and 279 transitions. [2019-03-04 16:24:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:42,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:42,693 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:24:42,693 INFO L226 Difference]: Without dead ends: 88 [2019-03-04 16:24:42,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-03-04 16:24:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2019-03-04 16:24:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-03-04 16:24:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 222 transitions. [2019-03-04 16:24:42,719 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 222 transitions. Word has length 4 [2019-03-04 16:24:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:42,720 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 222 transitions. [2019-03-04 16:24:42,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 222 transitions. [2019-03-04 16:24:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:42,721 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:42,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:42,721 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-03-04 16:24:42,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:42,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,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:24:42,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:42,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:42,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,882 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:42,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:42,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:42,964 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,970 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,980 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,992 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,014 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,038 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:24:43,050 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:24:43,054 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:43,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:43,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:24:43,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:43,136 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,146 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,322 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,494 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,622 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,641 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,671 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,671 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:43,744 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:43,745 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,802 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,802 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:24:43,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:24:43,847 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,865 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,866 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:24:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:43,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:43,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:43,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:43,904 INFO L87 Difference]: Start difference. First operand 50 states and 222 transitions. Second operand 8 states. [2019-03-04 16:24:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:44,360 INFO L93 Difference]: Finished difference Result 81 states and 279 transitions. [2019-03-04 16:24:44,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:44,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:44,362 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:24:44,362 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:24:44,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 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:24:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:24:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2019-03-04 16:24:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-03-04 16:24:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 249 transitions. [2019-03-04 16:24:44,376 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 249 transitions. Word has length 4 [2019-03-04 16:24:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:44,377 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 249 transitions. [2019-03-04 16:24:44,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 249 transitions. [2019-03-04 16:24:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:44,378 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:44,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:44,378 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-03-04 16:24:44,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:44,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:44,758 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:24:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:44,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:44,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:44,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:45,012 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:24:45,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:45,244 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:24:45,245 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,253 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,268 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,287 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,313 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,343 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,380 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 21 treesize of output 24 [2019-03-04 16:24:45,384 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 24 treesize of output 26 [2019-03-04 16:24:45,387 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 26 treesize of output 28 [2019-03-04 16:24:45,392 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 28 treesize of output 30 [2019-03-04 16:24:45,411 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 30 treesize of output 32 [2019-03-04 16:24:45,423 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:24:45,423 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,435 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,447 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,460 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,470 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,482 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,527 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:45,527 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:24:45,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, 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:24:45,569 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,616 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:45,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:24:45,662 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:24:45,663 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,701 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:24:45,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:24:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:45,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:45,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:45,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:45,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:45,744 INFO L87 Difference]: Start difference. First operand 54 states and 249 transitions. Second operand 8 states. [2019-03-04 16:24:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:46,213 INFO L93 Difference]: Finished difference Result 88 states and 292 transitions. [2019-03-04 16:24:46,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:46,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:46,215 INFO L225 Difference]: With dead ends: 88 [2019-03-04 16:24:46,215 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:24:46,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:24:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 55. [2019-03-04 16:24:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:24:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 256 transitions. [2019-03-04 16:24:46,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 256 transitions. Word has length 4 [2019-03-04 16:24:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:46,229 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 256 transitions. [2019-03-04 16:24:46,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 256 transitions. [2019-03-04 16:24:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:46,231 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:46,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:46,231 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-03-04 16:24:46,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:46,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:46,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:46,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:46,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:46,301 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 21 treesize of output 24 [2019-03-04 16:24:46,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:24:46,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,344 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:46,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:46,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,376 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:24:46,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:46,433 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,447 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,459 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,472 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,483 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,495 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,552 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:46,552 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,555 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,572 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,588 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,617 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:24:46,618 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-03-04 16:24:46,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:24:46,664 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:24:46,705 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:24:46,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:100 [2019-03-04 16:24:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:46,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:46,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:46,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:46,758 INFO L87 Difference]: Start difference. First operand 55 states and 256 transitions. Second operand 6 states. [2019-03-04 16:24:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:47,495 INFO L93 Difference]: Finished difference Result 74 states and 305 transitions. [2019-03-04 16:24:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:47,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:47,497 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:24:47,497 INFO L226 Difference]: Without dead ends: 73 [2019-03-04 16:24:47,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-03-04 16:24:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2019-03-04 16:24:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-03-04 16:24:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 293 transitions. [2019-03-04 16:24:47,515 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 293 transitions. Word has length 4 [2019-03-04 16:24:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:47,515 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 293 transitions. [2019-03-04 16:24:47,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 293 transitions. [2019-03-04 16:24:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:47,519 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:47,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:47,520 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:47,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:47,520 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-03-04 16:24:47,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:47,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:47,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:47,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:47,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,699 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2019-03-04 16:24:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:47,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:47,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:47,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:47,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:47,735 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 21 treesize of output 24 [2019-03-04 16:24:47,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,738 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:24:47,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:47,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,756 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 28 treesize of output 30 [2019-03-04 16:24:47,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,791 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 30 treesize of output 32 [2019-03-04 16:24:47,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:47,842 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,856 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,869 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,882 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,894 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,906 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,183 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:48,184 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,295 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,470 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,654 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,918 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,330 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:49,330 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:49,774 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-03-04 16:24:49,804 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:49,804 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,172 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:50,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:24:50,313 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,340 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,340 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:24:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:50,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:50,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:50,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:50,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:50,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:50,377 INFO L87 Difference]: Start difference. First operand 60 states and 293 transitions. Second operand 8 states. [2019-03-04 16:24:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:50,763 INFO L93 Difference]: Finished difference Result 95 states and 358 transitions. [2019-03-04 16:24:50,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:50,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:50,765 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:24:50,765 INFO L226 Difference]: Without dead ends: 91 [2019-03-04 16:24:50,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-03-04 16:24:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2019-03-04 16:24:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-03-04 16:24:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 327 transitions. [2019-03-04 16:24:50,787 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 327 transitions. Word has length 4 [2019-03-04 16:24:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:50,788 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 327 transitions. [2019-03-04 16:24:50,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 327 transitions. [2019-03-04 16:24:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:50,789 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:50,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:50,789 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 937560, now seen corresponding path program 1 times [2019-03-04 16:24:50,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:50,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:50,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:50,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:50,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:24:50,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,935 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 24 treesize of output 26 [2019-03-04 16:24:50,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,943 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 26 treesize of output 28 [2019-03-04 16:24:50,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,954 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:50,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,985 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 30 treesize of output 32 [2019-03-04 16:24:50,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:51,061 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,073 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,085 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,251 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,273 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,311 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,378 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:51,379 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,381 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,424 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,433 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,451 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,483 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,484 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:51,536 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:51,536 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,561 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,562 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:24:51,613 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:24:51,614 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,633 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,633 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:24:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:51,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:51,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:51,671 INFO L87 Difference]: Start difference. First operand 65 states and 327 transitions. Second operand 8 states. [2019-03-04 16:24:52,142 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-03-04 16:24:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:52,384 INFO L93 Difference]: Finished difference Result 103 states and 394 transitions. [2019-03-04 16:24:52,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:52,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:52,386 INFO L225 Difference]: With dead ends: 103 [2019-03-04 16:24:52,386 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:24:52,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:24:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2019-03-04 16:24:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-03-04 16:24:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 360 transitions. [2019-03-04 16:24:52,403 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 360 transitions. Word has length 4 [2019-03-04 16:24:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:52,403 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 360 transitions. [2019-03-04 16:24:52,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 360 transitions. [2019-03-04 16:24:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:52,404 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:52,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:52,405 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-03-04 16:24:52,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:52,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:52,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:52,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:52,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:52,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:52,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:52,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:52,607 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,615 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,627 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,644 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:24:52,677 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:24:52,682 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:52,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:52,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:24:52,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:52,736 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,746 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,769 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,781 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,794 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,806 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,837 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,837 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:24:52,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:52,934 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,961 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:24:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:52,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:52,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:52,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:52,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:52,995 INFO L87 Difference]: Start difference. First operand 72 states and 360 transitions. Second operand 6 states. [2019-03-04 16:24:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:53,171 INFO L93 Difference]: Finished difference Result 87 states and 372 transitions. [2019-03-04 16:24:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:53,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:53,173 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:24:53,173 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:24:53,174 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:24:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:24:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2019-03-04 16:24:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-03-04 16:24:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 359 transitions. [2019-03-04 16:24:53,188 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 359 transitions. Word has length 4 [2019-03-04 16:24:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:53,188 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 359 transitions. [2019-03-04 16:24:53,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 359 transitions. [2019-03-04 16:24:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:53,189 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:53,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:53,189 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-03-04 16:24:53,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:53,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:53,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:53,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:53,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:53,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:53,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:53,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:53,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:53,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:53,379 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 21 treesize of output 24 [2019-03-04 16:24:53,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,383 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 24 treesize of output 26 [2019-03-04 16:24:53,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,390 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 26 treesize of output 28 [2019-03-04 16:24:53,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,402 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 28 treesize of output 30 [2019-03-04 16:24:53,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,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 30 treesize of output 32 [2019-03-04 16:24:53,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,538 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:53,539 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,554 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,623 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,648 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,667 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,687 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:53,749 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,755 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,761 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,775 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,795 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,831 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,831 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:53,870 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:53,871 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,902 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,903 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:53,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:24:53,942 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,967 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:24:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:54,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:54,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:54,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:54,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:54,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:54,006 INFO L87 Difference]: Start difference. First operand 72 states and 359 transitions. Second operand 8 states. [2019-03-04 16:24:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:54,627 INFO L93 Difference]: Finished difference Result 101 states and 409 transitions. [2019-03-04 16:24:54,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:54,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:54,629 INFO L225 Difference]: With dead ends: 101 [2019-03-04 16:24:54,629 INFO L226 Difference]: Without dead ends: 100 [2019-03-04 16:24:54,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-03-04 16:24:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2019-03-04 16:24:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:24:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 389 transitions. [2019-03-04 16:24:54,642 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 389 transitions. Word has length 5 [2019-03-04 16:24:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:54,642 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 389 transitions. [2019-03-04 16:24:54,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 389 transitions. [2019-03-04 16:24:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:54,643 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:54,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:54,643 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-03-04 16:24:54,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:54,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:54,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:54,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:54,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:54,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:54,863 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:24:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:54,870 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 21 treesize of output 24 [2019-03-04 16:24:54,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,923 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 24 treesize of output 26 [2019-03-04 16:24:54,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,015 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:55,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,174 INFO L301 Elim1Store]: Index analysis took 131 ms [2019-03-04 16:24:55,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:55,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,445 INFO L301 Elim1Store]: Index analysis took 244 ms [2019-03-04 16:24:55,446 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 30 treesize of output 32 [2019-03-04 16:24:55,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,790 INFO L301 Elim1Store]: Index analysis took 316 ms [2019-03-04 16:24:55,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:24:55,791 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,803 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,817 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,832 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,846 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,868 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,924 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:24:55,925 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,931 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,945 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,966 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,987 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,014 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,058 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,058 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:24:56,094 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:24:56,094 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,136 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,136 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:24:56,198 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:24:56,199 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,231 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,232 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:24:56,291 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:24:56,292 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,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:24:56,318 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:24:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:56,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:56,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:56,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:56,362 INFO L87 Difference]: Start difference. First operand 76 states and 389 transitions. Second operand 10 states. [2019-03-04 16:24:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:57,178 INFO L93 Difference]: Finished difference Result 128 states and 473 transitions. [2019-03-04 16:24:57,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:57,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:57,181 INFO L225 Difference]: With dead ends: 128 [2019-03-04 16:24:57,181 INFO L226 Difference]: Without dead ends: 122 [2019-03-04 16:24:57,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-03-04 16:24:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2019-03-04 16:24:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-03-04 16:24:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 409 transitions. [2019-03-04 16:24:57,195 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 409 transitions. Word has length 5 [2019-03-04 16:24:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:57,195 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 409 transitions. [2019-03-04 16:24:57,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 409 transitions. [2019-03-04 16:24:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:57,195 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:57,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:57,196 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-03-04 16:24:57,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:57,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:57,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:57,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,278 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:24:57,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:57,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:57,352 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,364 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,375 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,398 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,424 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,454 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 21 treesize of output 24 [2019-03-04 16:24:57,458 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 24 treesize of output 26 [2019-03-04 16:24:57,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:57,469 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:57,480 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:24:57,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:57,521 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,532 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,543 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,556 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,568 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,581 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,757 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:57,757 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:24:57,813 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:57,814 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,843 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:57,843 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:57,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:24:57,887 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,907 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:57,908 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:24:58,003 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:24:58,003 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,020 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,020 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:24:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:58,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:58,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:58,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:58,060 INFO L87 Difference]: Start difference. First operand 82 states and 409 transitions. Second operand 10 states. [2019-03-04 16:24:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:58,634 INFO L93 Difference]: Finished difference Result 119 states and 474 transitions. [2019-03-04 16:24:58,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:58,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:58,636 INFO L225 Difference]: With dead ends: 119 [2019-03-04 16:24:58,636 INFO L226 Difference]: Without dead ends: 117 [2019-03-04 16:24:58,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-03-04 16:24:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2019-03-04 16:24:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:24:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 402 transitions. [2019-03-04 16:24:58,652 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 402 transitions. Word has length 5 [2019-03-04 16:24:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:58,652 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 402 transitions. [2019-03-04 16:24:58,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 402 transitions. [2019-03-04 16:24:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:58,653 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:58,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:58,654 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 29189162, now seen corresponding path program 2 times [2019-03-04 16:24:58,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:58,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:58,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:58,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:58,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:58,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:58,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:24:58,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:58,937 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:24:58,937 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,946 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,959 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,969 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,987 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,017 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,055 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:24:59,059 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 24 treesize of output 26 [2019-03-04 16:24:59,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:24:59,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:24:59,072 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:24:59,075 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:24:59,076 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,087 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,099 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,111 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,123 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,134 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,178 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:59,179 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:24:59,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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:24:59,216 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,258 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:59,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:24:59,299 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:24:59,300 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,399 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:59,400 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:24:59,460 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:24:59,460 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,487 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:24:59,487 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-03-04 16:24:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:59,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:59,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:59,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:59,531 INFO L87 Difference]: Start difference. First operand 81 states and 402 transitions. Second operand 10 states. [2019-03-04 16:25:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:00,232 INFO L93 Difference]: Finished difference Result 133 states and 546 transitions. [2019-03-04 16:25:00,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:00,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:00,234 INFO L225 Difference]: With dead ends: 133 [2019-03-04 16:25:00,234 INFO L226 Difference]: Without dead ends: 131 [2019-03-04 16:25:00,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-03-04 16:25:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 94. [2019-03-04 16:25:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:25:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 471 transitions. [2019-03-04 16:25:00,259 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 471 transitions. Word has length 5 [2019-03-04 16:25:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:00,259 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 471 transitions. [2019-03-04 16:25:00,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 471 transitions. [2019-03-04 16:25:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:00,260 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:00,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:00,261 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-03-04 16:25:00,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:00,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:00,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:00,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:00,771 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-03-04 16:25:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:00,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:00,848 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:25:00,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:00,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:00,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:00,898 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 21 treesize of output 24 [2019-03-04 16:25:00,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,904 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 24 treesize of output 26 [2019-03-04 16:25:00,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,912 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 26 treesize of output 28 [2019-03-04 16:25:00,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,933 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 28 treesize of output 30 [2019-03-04 16:25:00,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,950 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 30 treesize of output 32 [2019-03-04 16:25:00,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:00,973 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,987 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,000 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,014 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,027 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,041 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,103 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:01,104 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,109 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,120 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,136 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,154 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,182 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,226 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,226 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:01,264 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:01,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,306 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,306 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:01,351 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:01,351 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,388 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,389 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:25:01,462 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:25:01,463 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,495 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:01,495 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:61 [2019-03-04 16:25:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:01,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:01,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:01,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:01,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:01,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:01,542 INFO L87 Difference]: Start difference. First operand 94 states and 471 transitions. Second operand 10 states. [2019-03-04 16:25:02,586 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-03-04 16:25:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:03,032 INFO L93 Difference]: Finished difference Result 127 states and 524 transitions. [2019-03-04 16:25:03,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:03,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:03,036 INFO L225 Difference]: With dead ends: 127 [2019-03-04 16:25:03,036 INFO L226 Difference]: Without dead ends: 126 [2019-03-04 16:25:03,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-03-04 16:25:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2019-03-04 16:25:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-03-04 16:25:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 485 transitions. [2019-03-04 16:25:03,060 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 485 transitions. Word has length 5 [2019-03-04 16:25:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:03,060 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 485 transitions. [2019-03-04 16:25:03,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 485 transitions. [2019-03-04 16:25:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:03,061 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:03,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:03,061 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash 29175460, now seen corresponding path program 1 times [2019-03-04 16:25:03,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:03,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:03,496 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-03-04 16:25:03,730 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-03-04 16:25:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:03,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:03,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 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:25:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:03,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:03,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:03,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:03,827 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,836 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,849 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,864 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,897 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:03,938 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 24 treesize of output 26 [2019-03-04 16:25:03,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:03,948 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:03,953 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 30 treesize of output 32 [2019-03-04 16:25:04,012 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:04,013 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,025 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,037 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,066 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,078 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,090 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,121 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:04,121 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:04,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:04,174 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,201 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:04,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:25:04,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:25:04,375 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,394 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:04,395 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-03-04 16:25:04,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:25:04,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,547 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:04,547 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:25:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:04,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:04,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:04,586 INFO L87 Difference]: Start difference. First operand 96 states and 485 transitions. Second operand 10 states. [2019-03-04 16:25:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:05,097 INFO L93 Difference]: Finished difference Result 136 states and 550 transitions. [2019-03-04 16:25:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:05,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:05,100 INFO L225 Difference]: With dead ends: 136 [2019-03-04 16:25:05,100 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:25:05,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:25:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 93. [2019-03-04 16:25:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:25:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 463 transitions. [2019-03-04 16:25:05,120 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 463 transitions. Word has length 5 [2019-03-04 16:25:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:05,121 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 463 transitions. [2019-03-04 16:25:05,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 463 transitions. [2019-03-04 16:25:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:05,121 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:05,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:05,122 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:05,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:05,122 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-03-04 16:25:05,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:05,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:05,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:05,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:05,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:05,278 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:25:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:05,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:05,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:05,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:05,393 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:05,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:05,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:05,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,404 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 24 treesize of output 26 [2019-03-04 16:25:05,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,412 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 26 treesize of output 28 [2019-03-04 16:25:05,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,424 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 28 treesize of output 30 [2019-03-04 16:25:05,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,440 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:05,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:05,464 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,477 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,490 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,504 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,517 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,530 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,587 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:05,587 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,592 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,601 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,619 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,663 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,690 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,733 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,734 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:05,797 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:05,798 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,848 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:05,891 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:05,891 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,923 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,923 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:25:05,976 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:25:05,977 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,016 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:06,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:25:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:06,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:06,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:06,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:06,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:06,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:06,057 INFO L87 Difference]: Start difference. First operand 93 states and 463 transitions. Second operand 10 states. [2019-03-04 16:25:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:06,650 INFO L93 Difference]: Finished difference Result 140 states and 570 transitions. [2019-03-04 16:25:06,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:06,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:06,652 INFO L225 Difference]: With dead ends: 140 [2019-03-04 16:25:06,652 INFO L226 Difference]: Without dead ends: 137 [2019-03-04 16:25:06,653 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:25:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-03-04 16:25:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 102. [2019-03-04 16:25:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-03-04 16:25:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 526 transitions. [2019-03-04 16:25:06,675 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 526 transitions. Word has length 5 [2019-03-04 16:25:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:06,675 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 526 transitions. [2019-03-04 16:25:06,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 526 transitions. [2019-03-04 16:25:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:06,676 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:06,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:06,677 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:06,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash 29179740, now seen corresponding path program 1 times [2019-03-04 16:25:06,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:06,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:06,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:06,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:06,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:06,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:06,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:25:06,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:06,809 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 21 treesize of output 24 [2019-03-04 16:25:06,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:25:06,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:06,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,853 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:06,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,870 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:06,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:06,896 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,910 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,923 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,937 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,954 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,967 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:07,023 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,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:07,044 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,064 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,089 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,134 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,134 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:25:07,230 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:07,231 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,299 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:25:07,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, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:25:07,339 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,368 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:07,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:53 [2019-03-04 16:25:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:07,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:07,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:07,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:07,418 INFO L87 Difference]: Start difference. First operand 102 states and 526 transitions. Second operand 8 states. [2019-03-04 16:25:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:08,080 INFO L93 Difference]: Finished difference Result 138 states and 575 transitions. [2019-03-04 16:25:08,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:08,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:08,081 INFO L225 Difference]: With dead ends: 138 [2019-03-04 16:25:08,082 INFO L226 Difference]: Without dead ends: 137 [2019-03-04 16:25:08,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-03-04 16:25:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2019-03-04 16:25:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:25:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 520 transitions. [2019-03-04 16:25:08,100 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 520 transitions. Word has length 5 [2019-03-04 16:25:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:08,100 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 520 transitions. [2019-03-04 16:25:08,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 520 transitions. [2019-03-04 16:25:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:08,101 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:08,101 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:25:08,101 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 28825780, now seen corresponding path program 2 times [2019-03-04 16:25:08,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:08,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:08,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:08,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:08,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:08,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:08,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:08,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:08,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:08,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:08,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:08,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:08,216 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 21 treesize of output 24 [2019-03-04 16:25:08,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:25:08,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,249 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 26 treesize of output 28 [2019-03-04 16:25:08,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,265 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 28 treesize of output 30 [2019-03-04 16:25:08,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:08,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,322 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:08,323 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,356 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,368 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,381 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,395 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,408 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,463 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:08,464 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,469 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,480 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,502 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,527 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,555 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,599 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:08,600 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:08,654 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:08,654 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:08,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:08,731 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:08,732 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,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:25:08,763 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:25:08,876 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 43 treesize of output 65 [2019-03-04 16:25:08,877 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,914 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:08,914 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:57 [2019-03-04 16:25:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:08,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:08,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:25:08,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:08,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:08,955 INFO L87 Difference]: Start difference. First operand 101 states and 520 transitions. Second operand 9 states. [2019-03-04 16:25:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:09,542 INFO L93 Difference]: Finished difference Result 161 states and 709 transitions. [2019-03-04 16:25:09,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:09,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:25:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:09,546 INFO L225 Difference]: With dead ends: 161 [2019-03-04 16:25:09,546 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:25:09,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:25:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 93. [2019-03-04 16:25:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:25:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 463 transitions. [2019-03-04 16:25:09,569 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 463 transitions. Word has length 5 [2019-03-04 16:25:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:09,569 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 463 transitions. [2019-03-04 16:25:09,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 463 transitions. [2019-03-04 16:25:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:09,570 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:09,570 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:25:09,571 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash 28814000, now seen corresponding path program 1 times [2019-03-04 16:25:09,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:09,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:09,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:09,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:09,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:09,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:09,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:09,674 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:09,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:09,707 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 21 treesize of output 24 [2019-03-04 16:25:09,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,750 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 24 treesize of output 26 [2019-03-04 16:25:09,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,778 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 26 treesize of output 28 [2019-03-04 16:25:09,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,789 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 28 treesize of output 30 [2019-03-04 16:25:09,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,808 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:09,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,857 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:09,858 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,869 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,882 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,917 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,930 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,942 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,991 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:09,992 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,999 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,010 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,026 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,044 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,076 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:10,076 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:10,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:10,110 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,140 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,141 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:25:10,197 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 51 [2019-03-04 16:25:10,197 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,219 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,219 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:50 [2019-03-04 16:25:10,259 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:25:10,259 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,280 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,280 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:25:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:10,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:10,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:10,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:10,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:10,316 INFO L87 Difference]: Start difference. First operand 93 states and 463 transitions. Second operand 10 states. [2019-03-04 16:25:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:10,826 INFO L93 Difference]: Finished difference Result 171 states and 643 transitions. [2019-03-04 16:25:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:10,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:10,829 INFO L225 Difference]: With dead ends: 171 [2019-03-04 16:25:10,829 INFO L226 Difference]: Without dead ends: 170 [2019-03-04 16:25:10,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-03-04 16:25:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 105. [2019-03-04 16:25:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-03-04 16:25:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 547 transitions. [2019-03-04 16:25:10,856 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 547 transitions. Word has length 5 [2019-03-04 16:25:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 547 transitions. [2019-03-04 16:25:10,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 547 transitions. [2019-03-04 16:25:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:10,857 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:10,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:10,858 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-03-04 16:25:10,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:10,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:10,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:10,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:10,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:10,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:10,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:25:10,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:11,003 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:11,004 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,015 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,028 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,044 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,068 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:11,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:25:11,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:11,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:11,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:11,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:11,156 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,168 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,182 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,196 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,209 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,223 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,261 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:11,262 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:11,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:11,305 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,337 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:11,337 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:25:11,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:11,378 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,401 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:11,402 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:25:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:11,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:11,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:25:11,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:25:11,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:25:11,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:25:11,452 INFO L87 Difference]: Start difference. First operand 105 states and 547 transitions. Second operand 7 states. [2019-03-04 16:25:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:11,814 INFO L93 Difference]: Finished difference Result 142 states and 615 transitions. [2019-03-04 16:25:11,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:11,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-03-04 16:25:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:11,816 INFO L225 Difference]: With dead ends: 142 [2019-03-04 16:25:11,816 INFO L226 Difference]: Without dead ends: 140 [2019-03-04 16:25:11,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-03-04 16:25:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2019-03-04 16:25:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:25:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 579 transitions. [2019-03-04 16:25:11,840 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 579 transitions. Word has length 5 [2019-03-04 16:25:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:11,840 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 579 transitions. [2019-03-04 16:25:11,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:25:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 579 transitions. [2019-03-04 16:25:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:11,840 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:11,841 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:25:11,841 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash 28831732, now seen corresponding path program 1 times [2019-03-04 16:25:11,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:11,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:11,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:11,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:11,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:11,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:11,969 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:11,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,975 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 24 treesize of output 26 [2019-03-04 16:25:11,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,982 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 26 treesize of output 28 [2019-03-04 16:25:11,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:11,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:12,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,038 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:12,039 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,053 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,065 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,077 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,090 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,103 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,156 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:12,156 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,161 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,172 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,188 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,214 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,241 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,285 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:12,286 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:12,307 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:12,307 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,348 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,348 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:12,379 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:12,380 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,412 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:25:12,641 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 43 treesize of output 61 [2019-03-04 16:25:12,641 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,669 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:12,669 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:57 [2019-03-04 16:25:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:12,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:12,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:25:12,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:12,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:12,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:12,708 INFO L87 Difference]: Start difference. First operand 112 states and 579 transitions. Second operand 9 states. [2019-03-04 16:25:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:13,272 INFO L93 Difference]: Finished difference Result 167 states and 697 transitions. [2019-03-04 16:25:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:13,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:25:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:13,275 INFO L225 Difference]: With dead ends: 167 [2019-03-04 16:25:13,275 INFO L226 Difference]: Without dead ends: 161 [2019-03-04 16:25:13,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-03-04 16:25:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 117. [2019-03-04 16:25:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-03-04 16:25:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 619 transitions. [2019-03-04 16:25:13,306 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 619 transitions. Word has length 5 [2019-03-04 16:25:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:13,306 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 619 transitions. [2019-03-04 16:25:13,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 619 transitions. [2019-03-04 16:25:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:13,307 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:13,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:13,307 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash 28831298, now seen corresponding path program 1 times [2019-03-04 16:25:13,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:13,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:13,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:13,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:13,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:13,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:13,454 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:13,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:13,459 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 21 treesize of output 24 [2019-03-04 16:25:13,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,466 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 24 treesize of output 26 [2019-03-04 16:25:13,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,471 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 26 treesize of output 28 [2019-03-04 16:25:13,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,483 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 28 treesize of output 30 [2019-03-04 16:25:13,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,499 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 30 treesize of output 32 [2019-03-04 16:25:13,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,548 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:13,548 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,559 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,572 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,584 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,597 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,609 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:13,652 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,656 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,664 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,680 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,696 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,726 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:13,727 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:13,971 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-03-04 16:25:14,008 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:14,009 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:14,095 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:14,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-03-04 16:25:14,385 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-03-04 16:25:14,448 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 83 [2019-03-04 16:25:14,449 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,586 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 65 treesize of output 95 [2019-03-04 16:25:14,592 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-03-04 16:25:14,819 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-03-04 16:25:14,819 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:316 [2019-03-04 16:25:15,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 16:25:15,072 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,197 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:25:15,197 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,292 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2019-03-04 16:25:15,293 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,374 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:15,374 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 15 variables, input treesize:197, output treesize:131 [2019-03-04 16:25:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:15,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:15,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:15,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:15,459 INFO L87 Difference]: Start difference. First operand 117 states and 619 transitions. Second operand 10 states. [2019-03-04 16:25:15,933 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2019-03-04 16:25:16,336 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-03-04 16:25:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:16,848 INFO L93 Difference]: Finished difference Result 228 states and 904 transitions. [2019-03-04 16:25:16,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:25:16,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:16,851 INFO L225 Difference]: With dead ends: 228 [2019-03-04 16:25:16,851 INFO L226 Difference]: Without dead ends: 226 [2019-03-04 16:25:16,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:25:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-03-04 16:25:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 127. [2019-03-04 16:25:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-03-04 16:25:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 689 transitions. [2019-03-04 16:25:16,889 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 689 transitions. Word has length 5 [2019-03-04 16:25:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:16,890 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 689 transitions. [2019-03-04 16:25:16,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 689 transitions. [2019-03-04 16:25:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:16,890 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:16,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:16,891 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-03-04 16:25:16,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:16,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,271 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-03-04 16:25:17,272 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:17,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:25:17,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:25:17,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:25:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:25:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:25:17,273 INFO L87 Difference]: Start difference. First operand 127 states and 689 transitions. Second operand 4 states. [2019-03-04 16:25:17,419 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-03-04 16:25:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:17,543 INFO L93 Difference]: Finished difference Result 146 states and 722 transitions. [2019-03-04 16:25:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:25:17,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:25:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:17,546 INFO L225 Difference]: With dead ends: 146 [2019-03-04 16:25:17,546 INFO L226 Difference]: Without dead ends: 143 [2019-03-04 16:25:17,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:25:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-03-04 16:25:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2019-03-04 16:25:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:25:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 705 transitions. [2019-03-04 16:25:17,585 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 705 transitions. Word has length 5 [2019-03-04 16:25:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:17,585 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 705 transitions. [2019-03-04 16:25:17,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:25:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 705 transitions. [2019-03-04 16:25:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:17,586 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:17,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:17,586 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-03-04 16:25:17,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:17,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:17,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:17,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:17,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:17,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,712 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:25:17,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:17,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:17,738 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,740 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,750 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,764 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,782 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,806 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 21 treesize of output 24 [2019-03-04 16:25:17,809 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 24 treesize of output 26 [2019-03-04 16:25:17,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:17,815 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:17,819 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:17,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:17,856 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,868 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,878 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,890 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,901 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,912 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:17,944 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:17,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:17,988 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,016 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:18,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:25:18,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:18,051 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,071 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:18,071 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:25:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:18,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:18,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:18,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:18,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:18,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:18,109 INFO L87 Difference]: Start difference. First operand 132 states and 705 transitions. Second operand 8 states. [2019-03-04 16:25:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:18,454 INFO L93 Difference]: Finished difference Result 154 states and 744 transitions. [2019-03-04 16:25:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:18,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:18,456 INFO L225 Difference]: With dead ends: 154 [2019-03-04 16:25:18,456 INFO L226 Difference]: Without dead ends: 153 [2019-03-04 16:25:18,457 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:25:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-03-04 16:25:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2019-03-04 16:25:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:25:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 719 transitions. [2019-03-04 16:25:18,491 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 719 transitions. Word has length 5 [2019-03-04 16:25:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:18,491 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 719 transitions. [2019-03-04 16:25:18,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 719 transitions. [2019-03-04 16:25:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:18,492 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:18,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:18,492 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-03-04 16:25:18,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:18,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:18,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:18,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:18,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:18,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:18,692 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 21 treesize of output 24 [2019-03-04 16:25:18,704 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:25:18,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,714 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:18,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:18,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,742 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:18,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,793 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:18,794 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,805 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,818 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,831 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,845 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,859 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,900 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:18,901 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,907 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,048 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,136 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,172 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:19,173 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:25:19,226 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:19,226 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,269 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:19,270 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:25:19,398 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:19,398 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,416 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:19,417 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:36 [2019-03-04 16:25:19,434 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:19,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:19,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:19,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:19,455 INFO L87 Difference]: Start difference. First operand 134 states and 719 transitions. Second operand 8 states. [2019-03-04 16:25:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:19,748 INFO L93 Difference]: Finished difference Result 152 states and 740 transitions. [2019-03-04 16:25:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:19,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:19,751 INFO L225 Difference]: With dead ends: 152 [2019-03-04 16:25:19,751 INFO L226 Difference]: Without dead ends: 151 [2019-03-04 16:25:19,752 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:25:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-03-04 16:25:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2019-03-04 16:25:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:25:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 710 transitions. [2019-03-04 16:25:19,784 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 710 transitions. Word has length 5 [2019-03-04 16:25:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:19,784 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 710 transitions. [2019-03-04 16:25:19,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 710 transitions. [2019-03-04 16:25:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:19,785 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:19,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:19,785 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-03-04 16:25:19,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:19,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:19,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:19,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:19,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:19,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:19,972 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 21 treesize of output 24 [2019-03-04 16:25:19,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,978 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 24 treesize of output 26 [2019-03-04 16:25:19,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,996 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 26 treesize of output 28 [2019-03-04 16:25:20,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,008 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 28 treesize of output 30 [2019-03-04 16:25:20,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,026 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 30 treesize of output 32 [2019-03-04 16:25:20,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:20,050 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,062 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,076 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,089 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,103 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,115 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,172 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:20,172 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,176 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,183 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,194 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,213 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,241 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,286 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,287 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:20,320 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,320 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,364 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,365 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:20,421 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:20,422 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,455 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,455 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:25:20,508 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:25:20,509 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,533 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,533 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:25:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:20,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:20,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:20,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:20,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:20,584 INFO L87 Difference]: Start difference. First operand 132 states and 710 transitions. Second operand 10 states. [2019-03-04 16:25:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:21,255 INFO L93 Difference]: Finished difference Result 178 states and 803 transitions. [2019-03-04 16:25:21,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:21,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:21,258 INFO L225 Difference]: With dead ends: 178 [2019-03-04 16:25:21,258 INFO L226 Difference]: Without dead ends: 176 [2019-03-04 16:25:21,258 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:25:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-03-04 16:25:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2019-03-04 16:25:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-03-04 16:25:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 759 transitions. [2019-03-04 16:25:21,303 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 759 transitions. Word has length 5 [2019-03-04 16:25:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:21,303 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 759 transitions. [2019-03-04 16:25:21,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 759 transitions. [2019-03-04 16:25:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:21,304 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:21,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:21,304 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash 29295060, now seen corresponding path program 1 times [2019-03-04 16:25:21,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:21,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,581 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:21,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:21,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:21,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:21,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:21,654 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 21 treesize of output 24 [2019-03-04 16:25:21,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:25:21,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:21,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,041 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:22,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:22,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,122 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:22,123 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,137 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,159 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,170 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,183 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,194 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,233 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:22,233 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,240 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,249 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,265 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,295 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:22,295 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:25:22,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:22,325 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,351 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:22,351 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:25:22,387 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:25:22,388 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:22,424 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:22,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-03-04 16:25:22,599 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2019-03-04 16:25:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:22,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:22,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:22,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:22,621 INFO L87 Difference]: Start difference. First operand 139 states and 759 transitions. Second operand 8 states. [2019-03-04 16:25:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:22,911 INFO L93 Difference]: Finished difference Result 181 states and 926 transitions. [2019-03-04 16:25:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:22,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:22,913 INFO L225 Difference]: With dead ends: 181 [2019-03-04 16:25:22,914 INFO L226 Difference]: Without dead ends: 180 [2019-03-04 16:25:22,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-03-04 16:25:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 146. [2019-03-04 16:25:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-03-04 16:25:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 808 transitions. [2019-03-04 16:25:22,955 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 808 transitions. Word has length 5 [2019-03-04 16:25:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:22,955 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 808 transitions. [2019-03-04 16:25:22,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 808 transitions. [2019-03-04 16:25:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:22,956 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:22,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:22,956 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-03-04 16:25:22,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:22,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:23,033 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:23,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:23,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:23,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:23,047 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:25:23,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:23,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:23,088 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,097 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,112 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,136 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,169 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,207 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 21 treesize of output 24 [2019-03-04 16:25:23,220 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:25:23,224 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:23,231 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:23,237 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:23,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:23,243 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,255 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,267 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,279 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,291 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,303 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,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:25:23,347 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:25:23,373 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:23,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,413 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,414 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-03-04 16:25:23,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, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:25:23,451 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,481 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,481 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-03-04 16:25:23,513 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:23,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:23,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:23,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:23,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:23,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:23,531 INFO L87 Difference]: Start difference. First operand 146 states and 808 transitions. Second operand 8 states. [2019-03-04 16:25:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:23,803 INFO L93 Difference]: Finished difference Result 170 states and 837 transitions. [2019-03-04 16:25:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:23,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:23,806 INFO L225 Difference]: With dead ends: 170 [2019-03-04 16:25:23,806 INFO L226 Difference]: Without dead ends: 169 [2019-03-04 16:25:23,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-03-04 16:25:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 146. [2019-03-04 16:25:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-03-04 16:25:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 808 transitions. [2019-03-04 16:25:23,840 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 808 transitions. Word has length 5 [2019-03-04 16:25:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:23,840 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 808 transitions. [2019-03-04 16:25:23,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 808 transitions. [2019-03-04 16:25:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:23,841 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:23,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:23,841 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 29350238, now seen corresponding path program 2 times [2019-03-04 16:25:23,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:23,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:23,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:23,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:23,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:23,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:23,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:23,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:23,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:23,955 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:23,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:23,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:23,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,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 24 treesize of output 26 [2019-03-04 16:25:23,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,979 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 26 treesize of output 28 [2019-03-04 16:25:23,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:24,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,015 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 30 treesize of output 32 [2019-03-04 16:25:24,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:24,038 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,051 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,064 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,078 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,090 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,103 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,178 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,179 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,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:24,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:24,241 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,274 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,308 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:24,366 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:24,400 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,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,461 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:24,461 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:24,512 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:24,513 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,544 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:24,545 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:25:24,597 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:25:24,597 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,623 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,623 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:25:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:24,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:24,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:24,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:24,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:24,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:24,661 INFO L87 Difference]: Start difference. First operand 146 states and 808 transitions. Second operand 10 states. [2019-03-04 16:25:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:25,235 INFO L93 Difference]: Finished difference Result 261 states and 1295 transitions. [2019-03-04 16:25:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:25,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:25,239 INFO L225 Difference]: With dead ends: 261 [2019-03-04 16:25:25,239 INFO L226 Difference]: Without dead ends: 257 [2019-03-04 16:25:25,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-03-04 16:25:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 202. [2019-03-04 16:25:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-03-04 16:25:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1205 transitions. [2019-03-04 16:25:25,286 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1205 transitions. Word has length 5 [2019-03-04 16:25:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:25,286 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1205 transitions. [2019-03-04 16:25:25,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1205 transitions. [2019-03-04 16:25:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:25,288 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:25,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:25,288 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:25,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29365862, now seen corresponding path program 3 times [2019-03-04 16:25:25,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:25,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:25,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:25,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:25,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:25,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:25:25,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:25,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:25,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:25,445 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 21 treesize of output 24 [2019-03-04 16:25:25,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,450 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 24 treesize of output 26 [2019-03-04 16:25:25,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:25,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,469 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:25,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:25,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:25,509 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,522 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,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:25,549 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,562 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,575 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,799 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:25,800 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,802 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,811 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,828 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,853 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,883 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,931 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:25,931 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:25,969 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:25,970 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,015 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:26,015 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:26,071 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:26,072 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,109 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:26,110 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:25:26,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, 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:25:26,170 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,198 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,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:25:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:26,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:26,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:26,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:26,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:26,242 INFO L87 Difference]: Start difference. First operand 202 states and 1205 transitions. Second operand 10 states. [2019-03-04 16:25:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:26,854 INFO L93 Difference]: Finished difference Result 260 states and 1339 transitions. [2019-03-04 16:25:26,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:26,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:26,858 INFO L225 Difference]: With dead ends: 260 [2019-03-04 16:25:26,858 INFO L226 Difference]: Without dead ends: 257 [2019-03-04 16:25:26,858 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:25:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-03-04 16:25:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 215. [2019-03-04 16:25:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-03-04 16:25:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1274 transitions. [2019-03-04 16:25:26,905 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1274 transitions. Word has length 5 [2019-03-04 16:25:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:26,905 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1274 transitions. [2019-03-04 16:25:26,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1274 transitions. [2019-03-04 16:25:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:26,906 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:26,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:26,906 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-03-04 16:25:26,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:26,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:26,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:26,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,037 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:27,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:27,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:27,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:27,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:27,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:27,087 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,095 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,107 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,128 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,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:27,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:25:27,180 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:27,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:27,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:27,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:27,232 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,243 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,254 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,266 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,278 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,289 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,319 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,320 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:25:27,522 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-03-04 16:25:27,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, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 41 treesize of output 71 [2019-03-04 16:25:27,604 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:25:27,863 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-03-04 16:25:27,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:437 [2019-03-04 16:25:27,991 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 92 [2019-03-04 16:25:28,012 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 72 [2019-03-04 16:25:28,013 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:25:28,119 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 56 [2019-03-04 16:25:28,211 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,271 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:28,272 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:198, output treesize:126 [2019-03-04 16:25:28,341 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,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:28,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:28,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:28,360 INFO L87 Difference]: Start difference. First operand 215 states and 1274 transitions. Second operand 8 states. [2019-03-04 16:25:28,740 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-03-04 16:25:28,929 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-03-04 16:25:29,134 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-03-04 16:25:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:37,688 INFO L93 Difference]: Finished difference Result 255 states and 1315 transitions. [2019-03-04 16:25:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:37,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:37,692 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:25:37,692 INFO L226 Difference]: Without dead ends: 254 [2019-03-04 16:25:37,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=45, Invalid=86, Unknown=1, NotChecked=0, Total=132 [2019-03-04 16:25:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-03-04 16:25:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 214. [2019-03-04 16:25:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:25:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1272 transitions. [2019-03-04 16:25:37,740 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1272 transitions. Word has length 5 [2019-03-04 16:25:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:37,740 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1272 transitions. [2019-03-04 16:25:37,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1272 transitions. [2019-03-04 16:25:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:37,741 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:37,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:37,741 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-03-04 16:25:37,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:37,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:37,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:37,894 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:37,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:37,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:37,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:37,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:37,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:37,915 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 21 treesize of output 24 [2019-03-04 16:25:37,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:25:37,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,940 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:37,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,953 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:37,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,971 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:37,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,995 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:37,995 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,008 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,021 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,033 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,046 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,058 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:38,106 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,109 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,120 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,138 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,163 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,205 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:38,205 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-03-04 16:25:38,230 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:38,231 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,268 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:38,268 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:69 [2019-03-04 16:25:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:38,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:38,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:38,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:38,304 INFO L87 Difference]: Start difference. First operand 214 states and 1272 transitions. Second operand 6 states. [2019-03-04 16:25:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:38,520 INFO L93 Difference]: Finished difference Result 226 states and 1282 transitions. [2019-03-04 16:25:38,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:38,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:25:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:38,524 INFO L225 Difference]: With dead ends: 226 [2019-03-04 16:25:38,524 INFO L226 Difference]: Without dead ends: 225 [2019-03-04 16:25:38,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-03-04 16:25:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2019-03-04 16:25:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:25:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1271 transitions. [2019-03-04 16:25:38,584 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1271 transitions. Word has length 5 [2019-03-04 16:25:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:38,584 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1271 transitions. [2019-03-04 16:25:38,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1271 transitions. [2019-03-04 16:25:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:38,585 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:38,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:38,585 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash 28950586, now seen corresponding path program 1 times [2019-03-04 16:25:38,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:38,736 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:25:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:38,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:38,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:38,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:38,805 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:38,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:38,813 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:38,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,818 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 24 treesize of output 26 [2019-03-04 16:25:38,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,826 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 26 treesize of output 28 [2019-03-04 16:25:38,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,838 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 28 treesize of output 30 [2019-03-04 16:25:38,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,855 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 30 treesize of output 32 [2019-03-04 16:25:38,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,878 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:38,879 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,892 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,906 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,920 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,933 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,947 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,004 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:39,004 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,011 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,021 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,039 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,064 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,092 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,137 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:39,138 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:39,184 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,185 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,234 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:39,234 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:39,281 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:39,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,318 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,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:25:39,386 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:25:39,387 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,418 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,419 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-03-04 16:25:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:39,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:39,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:39,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:39,464 INFO L87 Difference]: Start difference. First operand 214 states and 1271 transitions. Second operand 10 states. [2019-03-04 16:25:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:40,250 INFO L93 Difference]: Finished difference Result 259 states and 1356 transitions. [2019-03-04 16:25:40,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:40,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:40,253 INFO L225 Difference]: With dead ends: 259 [2019-03-04 16:25:40,254 INFO L226 Difference]: Without dead ends: 257 [2019-03-04 16:25:40,254 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:25:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-03-04 16:25:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 220. [2019-03-04 16:25:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:25:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1313 transitions. [2019-03-04 16:25:40,306 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1313 transitions. Word has length 5 [2019-03-04 16:25:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:40,306 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1313 transitions. [2019-03-04 16:25:40,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1313 transitions. [2019-03-04 16:25:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:40,307 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:40,307 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:25:40,307 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash 904669834, now seen corresponding path program 1 times [2019-03-04 16:25:40,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:40,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:40,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:40,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:40,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:40,491 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2019-03-04 16:25:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:40,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:40,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:40,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:40,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:40,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:40,576 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:40,577 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,583 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,591 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,609 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,633 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,662 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 21 treesize of output 24 [2019-03-04 16:25:40,665 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 24 treesize of output 26 [2019-03-04 16:25:40,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:40,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:40,674 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 30 treesize of output 32 [2019-03-04 16:25:40,712 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:40,713 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,723 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,735 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,746 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,758 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,769 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,800 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:40,801 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:41,030 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-03-04 16:25:41,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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:41,049 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:41,105 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:41,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:113 [2019-03-04 16:25:41,348 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-03-04 16:25:41,432 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 85 [2019-03-04 16:25:41,433 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 62 treesize of output 81 [2019-03-04 16:25:41,548 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,601 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:41,602 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:130, output treesize:110 [2019-03-04 16:25:41,920 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-03-04 16:25:41,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:25:41,944 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,031 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:25:42,032 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:42,120 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:42,121 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:130, output treesize:129 [2019-03-04 16:25:42,345 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-03-04 16:25:42,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:25:42,405 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 61 [2019-03-04 16:25:42,533 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 55 treesize of output 81 [2019-03-04 16:25:42,674 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2019-03-04 16:25:42,835 INFO L309 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-03-04 16:25:42,836 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:258 [2019-03-04 16:25:45,241 WARN L181 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 158 DAG size of output: 84 [2019-03-04 16:25:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:45,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:45,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:25:45,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:25:45,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:25:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:45,262 INFO L87 Difference]: Start difference. First operand 220 states and 1313 transitions. Second operand 11 states. [2019-03-04 16:25:45,842 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-03-04 16:25:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:46,518 INFO L93 Difference]: Finished difference Result 289 states and 1504 transitions. [2019-03-04 16:25:46,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:46,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:25:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:46,521 INFO L225 Difference]: With dead ends: 289 [2019-03-04 16:25:46,521 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 16:25:46,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 16:25:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 230. [2019-03-04 16:25:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-03-04 16:25:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 1400 transitions. [2019-03-04 16:25:46,576 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 1400 transitions. Word has length 6 [2019-03-04 16:25:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:46,576 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 1400 transitions. [2019-03-04 16:25:46,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:25:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 1400 transitions. [2019-03-04 16:25:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:46,577 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:46,577 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:25:46,577 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-03-04 16:25:46,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:46,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:46,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:46,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:46,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:46,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:46,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:46,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:46,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:46,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:46,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:46,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:25:46,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,744 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:46,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,755 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:46,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:46,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:47,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:47,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:47,043 INFO L301 Elim1Store]: Index analysis took 243 ms [2019-03-04 16:25:47,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, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:47,365 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,376 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,389 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,402 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,415 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,428 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:47,468 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,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:47,487 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,502 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,532 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:47,533 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:25:47,566 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:47,566 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,591 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:47,591 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:25:47,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 38 treesize of output 57 [2019-03-04 16:25:47,648 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,670 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:47,670 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-03-04 16:25:47,687 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:47,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:47,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:25:47,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:25:47,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:25:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:25:47,716 INFO L87 Difference]: Start difference. First operand 230 states and 1400 transitions. Second operand 7 states. [2019-03-04 16:25:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:47,982 INFO L93 Difference]: Finished difference Result 244 states and 1419 transitions. [2019-03-04 16:25:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:47,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:25:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:47,986 INFO L225 Difference]: With dead ends: 244 [2019-03-04 16:25:47,986 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 16:25:47,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 16:25:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 230. [2019-03-04 16:25:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-03-04 16:25:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 1400 transitions. [2019-03-04 16:25:48,045 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 1400 transitions. Word has length 6 [2019-03-04 16:25:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:48,045 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 1400 transitions. [2019-03-04 16:25:48,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:25:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 1400 transitions. [2019-03-04 16:25:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:48,046 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:48,046 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:25:48,047 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash 904323874, now seen corresponding path program 2 times [2019-03-04 16:25:48,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:48,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:48,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:48,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:48,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:48,324 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-03-04 16:25:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:48,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:48,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:48,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:48,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:48,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:48,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:25:48,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:48,426 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:48,426 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,434 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,451 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,472 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,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:48,524 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,561 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 21 treesize of output 24 [2019-03-04 16:25:48,565 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 24 treesize of output 26 [2019-03-04 16:25:48,569 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 26 treesize of output 28 [2019-03-04 16:25:48,572 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 28 treesize of output 30 [2019-03-04 16:25:48,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:48,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:48,581 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,591 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,603 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,615 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,627 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,639 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,684 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,684 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:48,715 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:48,716 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,758 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,758 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:48,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, 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:48,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,825 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,825 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:25:48,899 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 43 treesize of output 65 [2019-03-04 16:25:48,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,926 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,927 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:57 [2019-03-04 16:25:48,979 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:25:48,980 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:49,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:49,003 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-03-04 16:25:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:49,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:25:49,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:25:49,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:25:49,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:49,047 INFO L87 Difference]: Start difference. First operand 230 states and 1400 transitions. Second operand 11 states. [2019-03-04 16:25:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:49,956 INFO L93 Difference]: Finished difference Result 333 states and 1730 transitions. [2019-03-04 16:25:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:25:49,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:25:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:49,961 INFO L225 Difference]: With dead ends: 333 [2019-03-04 16:25:49,961 INFO L226 Difference]: Without dead ends: 328 [2019-03-04 16:25:49,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-03-04 16:25:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 245. [2019-03-04 16:25:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-03-04 16:25:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 1493 transitions. [2019-03-04 16:25:50,019 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 1493 transitions. Word has length 6 [2019-03-04 16:25:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:50,019 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 1493 transitions. [2019-03-04 16:25:50,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:25:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 1493 transitions. [2019-03-04 16:25:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:50,020 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:50,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:50,020 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:50,021 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-03-04 16:25:50,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:50,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:50,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:50,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:50,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:50,187 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:25:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:50,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:50,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:50,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:50,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:50,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:50,286 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 21 treesize of output 24 [2019-03-04 16:25:50,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,291 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 24 treesize of output 26 [2019-03-04 16:25:50,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,302 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 26 treesize of output 28 [2019-03-04 16:25:50,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,314 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 28 treesize of output 30 [2019-03-04 16:25:50,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:50,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,355 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:50,356 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,369 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,382 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,395 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,409 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,423 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,476 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:50,477 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,479 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,488 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,501 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,523 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,550 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,595 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:50,595 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:50,629 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:50,630 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,673 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:50,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:50,712 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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:50,713 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,745 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:50,746 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:25:50,799 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:25:50,799 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,823 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:50,823 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-03-04 16:25:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:50,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:50,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:50,868 INFO L87 Difference]: Start difference. First operand 245 states and 1493 transitions. Second operand 10 states. [2019-03-04 16:25:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:51,490 INFO L93 Difference]: Finished difference Result 295 states and 1633 transitions. [2019-03-04 16:25:51,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:51,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:51,494 INFO L225 Difference]: With dead ends: 295 [2019-03-04 16:25:51,494 INFO L226 Difference]: Without dead ends: 291 [2019-03-04 16:25:51,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-03-04 16:25:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-03-04 16:25:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-03-04 16:25:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1555 transitions. [2019-03-04 16:25:51,569 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1555 transitions. Word has length 6 [2019-03-04 16:25:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:51,569 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1555 transitions. [2019-03-04 16:25:51,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1555 transitions. [2019-03-04 16:25:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:51,570 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:51,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:51,570 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 904329766, now seen corresponding path program 1 times [2019-03-04 16:25:51,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:51,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:51,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:51,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:51,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:51,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:51,697 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:25:51,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,704 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 24 treesize of output 26 [2019-03-04 16:25:51,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,712 INFO 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 26 treesize of output 28 [2019-03-04 16:25:51,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,726 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 28 treesize of output 30 [2019-03-04 16:25:51,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,743 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 30 treesize of output 32 [2019-03-04 16:25:51,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:25:51,767 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,782 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,796 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,809 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,823 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,836 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,894 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:51,894 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,902 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,913 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,929 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,955 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,983 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:52,028 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:52,028 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:25:52,063 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:52,064 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:52,118 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:52,119 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:52,160 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:52,161 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:52,194 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:52,195 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:25:52,251 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:25:52,252 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:52,277 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:52,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:25:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:52,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:52,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:52,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:52,320 INFO L87 Difference]: Start difference. First operand 254 states and 1555 transitions. Second operand 10 states. [2019-03-04 16:25:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:53,671 INFO L93 Difference]: Finished difference Result 365 states and 2034 transitions. [2019-03-04 16:25:53,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:53,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:53,676 INFO L225 Difference]: With dead ends: 365 [2019-03-04 16:25:53,676 INFO L226 Difference]: Without dead ends: 364 [2019-03-04 16:25:53,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-03-04 16:25:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 302. [2019-03-04 16:25:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-03-04 16:25:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1895 transitions. [2019-03-04 16:25:53,768 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1895 transitions. Word has length 6 [2019-03-04 16:25:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:53,768 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 1895 transitions. [2019-03-04 16:25:53,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1895 transitions. [2019-03-04 16:25:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:53,769 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:53,769 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:25:53,769 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash 904316000, now seen corresponding path program 1 times [2019-03-04 16:25:53,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:53,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:53,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:53,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:53,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:53,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:53,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:53,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:53,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:53,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:53,929 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:53,929 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,933 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,942 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,959 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,977 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,001 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 21 treesize of output 24 [2019-03-04 16:25:54,004 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:25:54,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:54,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:54,014 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:25:54,052 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:54,053 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,063 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,075 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,086 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,098 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,109 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,141 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,141 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:54,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:54,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,208 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,208 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:25:54,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:25:54,241 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,261 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,261 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:25:54,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:25:54,301 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,318 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 16:25:54,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 48 [2019-03-04 16:25:54,378 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,391 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,391 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:34 [2019-03-04 16:25:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:54,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:54,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:25:54,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:25:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:25:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:54,431 INFO L87 Difference]: Start difference. First operand 302 states and 1895 transitions. Second operand 11 states. [2019-03-04 16:25:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:55,245 INFO L93 Difference]: Finished difference Result 407 states and 2302 transitions. [2019-03-04 16:25:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:55,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:25:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:55,250 INFO L225 Difference]: With dead ends: 407 [2019-03-04 16:25:55,250 INFO L226 Difference]: Without dead ends: 405 [2019-03-04 16:25:55,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-03-04 16:25:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 350. [2019-03-04 16:25:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-03-04 16:25:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 2231 transitions. [2019-03-04 16:25:55,346 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 2231 transitions. Word has length 6 [2019-03-04 16:25:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:55,346 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 2231 transitions. [2019-03-04 16:25:55,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:25:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 2231 transitions. [2019-03-04 16:25:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:55,347 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:55,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:55,347 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash 904316186, now seen corresponding path program 1 times [2019-03-04 16:25:55,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:55,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:55,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:55,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:55,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:55,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:55,566 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 21 treesize of output 24 [2019-03-04 16:25:55,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:25:55,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25: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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:55,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,595 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 28 treesize of output 30 [2019-03-04 16:25:55,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,611 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 30 treesize of output 32 [2019-03-04 16:25:55,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,618 INFO L188 IndexEqualityManager]: detected not equals via solver [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,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,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:55,662 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,675 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,688 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,701 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,713 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,725 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:55,769 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,774 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,783 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,793 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,811 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,843 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:55,844 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:25:55,945 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:55,946 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:55,997 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:55,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:110 [2019-03-04 16:25:56,111 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-03-04 16:25:56,136 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:25:56,136 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,224 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:25:56,225 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:56,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:56,324 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:130, output treesize:129 [2019-03-04 16:25:56,436 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-03-04 16:25:56,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 18 case distinctions, treesize of input 55 treesize of output 71 [2019-03-04 16:25:56,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:56,648 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 53 treesize of output 62 [2019-03-04 16:25:56,649 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:25:56,777 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,856 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-03-04 16:25:56,857 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:161 [2019-03-04 16:25:57,028 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-03-04 16:25:57,075 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 56 [2019-03-04 16:25:57,076 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 53 treesize of output 79 [2019-03-04 16:25:57,209 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-03-04 16:25:57,403 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 48 treesize of output 71 [2019-03-04 16:25:57,404 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-03-04 16:25:57,520 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:150, output treesize:222 [2019-03-04 16:25:57,660 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 82 [2019-03-04 16:25:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:57,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:57,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:57,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:57,681 INFO L87 Difference]: Start difference. First operand 350 states and 2231 transitions. Second operand 12 states. [2019-03-04 16:25:57,872 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-03-04 16:25:58,122 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-03-04 16:25:58,573 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-03-04 16:25:58,903 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-03-04 16:25:59,340 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-03-04 16:25:59,902 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-03-04 16:26:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:00,467 INFO L93 Difference]: Finished difference Result 784 states and 4704 transitions. [2019-03-04 16:26:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:26:00,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:26:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:00,477 INFO L225 Difference]: With dead ends: 784 [2019-03-04 16:26:00,477 INFO L226 Difference]: Without dead ends: 781 [2019-03-04 16:26:00,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:26:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-03-04 16:26:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 576. [2019-03-04 16:26:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-03-04 16:26:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 3814 transitions. [2019-03-04 16:26:00,686 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 3814 transitions. Word has length 6 [2019-03-04 16:26:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:00,687 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 3814 transitions. [2019-03-04 16:26:00,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 3814 transitions. [2019-03-04 16:26:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:00,688 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:00,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:00,689 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-03-04 16:26:00,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:00,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:00,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:00,798 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:00,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:00,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:00,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:00,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:26:00,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:00,817 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 21 treesize of output 24 [2019-03-04 16:26:00,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:00,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,842 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:00,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:00,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:00,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:00,922 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:00,923 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:00,936 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:00,949 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:00,962 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:00,974 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:00,987 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:01,051 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,055 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,063 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,079 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,109 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:01,109 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:26:01,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:01,150 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,175 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:01,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:26:01,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:26:01,220 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:01,260 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:01,260 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-03-04 16:26:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:01,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-03-04 16:26:01,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:01,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:01,327 INFO L87 Difference]: Start difference. First operand 576 states and 3814 transitions. Second operand 9 states. [2019-03-04 16:26:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:01,831 INFO L93 Difference]: Finished difference Result 635 states and 3985 transitions. [2019-03-04 16:26:01,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:01,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:26:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:01,839 INFO L225 Difference]: With dead ends: 635 [2019-03-04 16:26:01,839 INFO L226 Difference]: Without dead ends: 632 [2019-03-04 16:26:01,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-03-04 16:26:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 592. [2019-03-04 16:26:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-03-04 16:26:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 3937 transitions. [2019-03-04 16:26:01,994 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 3937 transitions. Word has length 6 [2019-03-04 16:26:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:01,994 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 3937 transitions. [2019-03-04 16:26:01,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:26:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 3937 transitions. [2019-03-04 16:26:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:01,996 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:01,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:01,996 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-03-04 16:26:01,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:01,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:02,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:02,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:02,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:02,101 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:02,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:02,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:02,148 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,156 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,164 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,178 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,195 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:02,222 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 24 treesize of output 26 [2019-03-04 16:26:02,225 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:02,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:02,232 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 30 treesize of output 32 [2019-03-04 16:26:02,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:02,271 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,283 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,295 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,307 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,318 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,328 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,359 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:02,359 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:26:02,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:02,408 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,435 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:02,436 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:26:02,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:26:02,473 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,492 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:02,492 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:26:02,540 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:26:02,541 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,555 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:02,556 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:26:02,580 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:02,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:02,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:02,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:02,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:02,599 INFO L87 Difference]: Start difference. First operand 592 states and 3937 transitions. Second operand 10 states. [2019-03-04 16:26:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:03,152 INFO L93 Difference]: Finished difference Result 653 states and 4203 transitions. [2019-03-04 16:26:03,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:03,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:03,160 INFO L225 Difference]: With dead ends: 653 [2019-03-04 16:26:03,160 INFO L226 Difference]: Without dead ends: 652 [2019-03-04 16:26:03,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-03-04 16:26:03,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 625. [2019-03-04 16:26:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-03-04 16:26:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 4168 transitions. [2019-03-04 16:26:03,351 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 4168 transitions. Word has length 6 [2019-03-04 16:26:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:03,351 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 4168 transitions. [2019-03-04 16:26:03,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 4168 transitions. [2019-03-04 16:26:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:03,353 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:03,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:03,353 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-03-04 16:26:03,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:03,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:03,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:03,508 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:26:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:03,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:03,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:03,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:03,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:26:03,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:03,642 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 21 treesize of output 24 [2019-03-04 16:26:03,653 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:03,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:03,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,673 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:03,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:03,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,714 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:03,714 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,727 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,740 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,753 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,767 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,780 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:03,830 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,839 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,855 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,876 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,901 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:03,944 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:26:03,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:03,975 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,016 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:04,017 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:26:04,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:26:04,062 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,090 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:04,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-03-04 16:26:04,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:26:04,149 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,173 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:04,174 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:47 [2019-03-04 16:26:04,196 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:04,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:04,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:04,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:04,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:04,216 INFO L87 Difference]: Start difference. First operand 625 states and 4168 transitions. Second operand 10 states. [2019-03-04 16:26:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:04,876 INFO L93 Difference]: Finished difference Result 661 states and 4204 transitions. [2019-03-04 16:26:04,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:04,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:04,884 INFO L225 Difference]: With dead ends: 661 [2019-03-04 16:26:04,884 INFO L226 Difference]: Without dead ends: 660 [2019-03-04 16:26:04,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-03-04 16:26:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 624. [2019-03-04 16:26:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-03-04 16:26:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 4161 transitions. [2019-03-04 16:26:05,051 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 4161 transitions. Word has length 6 [2019-03-04 16:26:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:05,051 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 4161 transitions. [2019-03-04 16:26:05,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 4161 transitions. [2019-03-04 16:26:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:05,053 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:05,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:05,053 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash 904792968, now seen corresponding path program 1 times [2019-03-04 16:26:05,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:05,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:05,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:05,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:05,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:05,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:05,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:05,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:26:05,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:05,224 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:05,224 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,232 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,247 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,273 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:05,334 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:05,341 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:05,347 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:05,358 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:05,426 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:05,426 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,440 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,458 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,468 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,480 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,492 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,521 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:05,522 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:26:05,879 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-03-04 16:26:05,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:05,886 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,911 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:05,911 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:26:05,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:26:05,946 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,964 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:05,964 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-03-04 16:26:06,015 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:26:06,016 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:06,050 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:06,050 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72 [2019-03-04 16:26:06,103 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:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:06,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:06,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:06,123 INFO L87 Difference]: Start difference. First operand 624 states and 4161 transitions. Second operand 10 states. [2019-03-04 16:26:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:06,908 INFO L93 Difference]: Finished difference Result 1114 states and 7399 transitions. [2019-03-04 16:26:06,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:06,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:06,920 INFO L225 Difference]: With dead ends: 1114 [2019-03-04 16:26:06,920 INFO L226 Difference]: Without dead ends: 1113 [2019-03-04 16:26:06,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-03-04 16:26:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1046. [2019-03-04 16:26:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-03-04 16:26:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 7156 transitions. [2019-03-04 16:26:07,202 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 7156 transitions. Word has length 6 [2019-03-04 16:26:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:07,202 INFO L480 AbstractCegarLoop]: Abstraction has 1046 states and 7156 transitions. [2019-03-04 16:26:07,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 7156 transitions. [2019-03-04 16:26:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:07,204 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:07,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:07,204 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-03-04 16:26:07,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:07,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:07,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:07,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:07,350 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:26:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:07,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:07,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:07,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:07,418 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:26:07,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:07,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:07,476 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,481 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,492 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,512 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,540 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,573 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 21 treesize of output 24 [2019-03-04 16:26:07,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:07,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:07,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, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:07,604 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:07,609 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:07,609 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,620 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,632 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,644 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,656 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,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:07,711 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:07,712 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:26:07,746 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:07,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,785 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:07,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:26:07,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:26:07,828 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,858 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:07,858 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-03-04 16:26:07,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:26:07,910 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,931 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:07,931 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-03-04 16:26:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:07,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:07,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:07,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:07,973 INFO L87 Difference]: Start difference. First operand 1046 states and 7156 transitions. Second operand 10 states. [2019-03-04 16:26:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:08,726 INFO L93 Difference]: Finished difference Result 1092 states and 7251 transitions. [2019-03-04 16:26:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:08,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:08,736 INFO L225 Difference]: With dead ends: 1092 [2019-03-04 16:26:08,736 INFO L226 Difference]: Without dead ends: 1091 [2019-03-04 16:26:08,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-03-04 16:26:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1054. [2019-03-04 16:26:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-03-04 16:26:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 7212 transitions. [2019-03-04 16:26:09,004 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 7212 transitions. Word has length 6 [2019-03-04 16:26:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:09,004 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 7212 transitions. [2019-03-04 16:26:09,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 7212 transitions. [2019-03-04 16:26:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:09,006 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:09,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:09,006 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:09,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-03-04 16:26:09,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:09,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:09,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:09,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:09,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:09,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:09,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:09,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:09,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 21 treesize of output 24 [2019-03-04 16:26:09,392 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:09,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:09,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,552 INFO L301 Elim1Store]: Index analysis took 130 ms [2019-03-04 16:26:09,566 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:09,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:09,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:09,636 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,649 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,661 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,673 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,686 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,699 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,747 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:09,748 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,756 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,770 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,791 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,816 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,857 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,857 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:26:09,882 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:09,883 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,922 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,923 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:26:09,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:26:09,965 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,993 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:09,994 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:59 [2019-03-04 16:26:10,091 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:10,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:10,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:10,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:10,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:10,109 INFO L87 Difference]: Start difference. First operand 1054 states and 7212 transitions. Second operand 8 states. [2019-03-04 16:26:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:10,823 INFO L93 Difference]: Finished difference Result 1073 states and 7229 transitions. [2019-03-04 16:26:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:10,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:26:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:10,828 INFO L225 Difference]: With dead ends: 1073 [2019-03-04 16:26:10,829 INFO L226 Difference]: Without dead ends: 1072 [2019-03-04 16:26:10,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-03-04 16:26:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1053. [2019-03-04 16:26:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-03-04 16:26:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 7204 transitions. [2019-03-04 16:26:11,134 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 7204 transitions. Word has length 6 [2019-03-04 16:26:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:11,134 INFO L480 AbstractCegarLoop]: Abstraction has 1053 states and 7204 transitions. [2019-03-04 16:26:11,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 7204 transitions. [2019-03-04 16:26:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:11,136 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:11,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:11,137 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash 904447008, now seen corresponding path program 2 times [2019-03-04 16:26:11,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:11,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:11,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:11,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:11,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:11,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:11,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:11,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:11,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:11,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:11,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:26:11,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:11,284 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:11,285 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,296 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,316 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,341 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,372 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,410 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 21 treesize of output 24 [2019-03-04 16:26:11,426 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:11,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, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:11,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:11,456 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:11,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:11,462 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,474 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,487 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,498 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,509 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,519 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,564 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:11,564 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:26:11,610 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:11,611 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,654 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:11,654 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:26:11,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:26:11,706 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:11,761 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:11,762 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:122 [2019-03-04 16:26:11,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:26:11,835 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,855 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:11,856 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:38 [2019-03-04 16:26:11,877 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:11,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:11,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:11,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:11,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:11,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:11,898 INFO L87 Difference]: Start difference. First operand 1053 states and 7204 transitions. Second operand 10 states. [2019-03-04 16:26:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:12,698 INFO L93 Difference]: Finished difference Result 1123 states and 7431 transitions. [2019-03-04 16:26:12,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:12,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:12,707 INFO L225 Difference]: With dead ends: 1123 [2019-03-04 16:26:12,707 INFO L226 Difference]: Without dead ends: 1121 [2019-03-04 16:26:12,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-03-04 16:26:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1060. [2019-03-04 16:26:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-03-04 16:26:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 7259 transitions. [2019-03-04 16:26:13,012 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 7259 transitions. Word has length 6 [2019-03-04 16:26:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:13,012 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 7259 transitions. [2019-03-04 16:26:13,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 7259 transitions. [2019-03-04 16:26:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:13,014 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:13,014 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:26:13,014 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash 893604880, now seen corresponding path program 3 times [2019-03-04 16:26:13,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:13,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:13,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:13,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:13,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:13,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:13,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:13,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:13,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:26:13,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:13,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:26:13,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:13,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:13,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,138 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 24 treesize of output 26 [2019-03-04 16:26:13,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,150 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 26 treesize of output 28 [2019-03-04 16:26:13,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,160 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 28 treesize of output 30 [2019-03-04 16:26:13,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:13,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,201 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:13,201 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,215 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,229 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,243 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,255 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,269 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,326 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:13,327 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,336 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,347 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,362 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,381 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,410 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,456 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:13,456 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:26:13,483 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:13,483 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,525 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,525 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:26:13,687 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:26:13,688 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:26:13,773 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:13,774 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,799 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,799 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:26:13,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 45 treesize of output 60 [2019-03-04 16:26:13,874 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,896 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:13,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-03-04 16:26:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:13,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:13,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:26:13,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:26:13,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:26:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:13,937 INFO L87 Difference]: Start difference. First operand 1060 states and 7259 transitions. Second operand 11 states. [2019-03-04 16:26:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:14,908 INFO L93 Difference]: Finished difference Result 1251 states and 8251 transitions. [2019-03-04 16:26:14,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:14,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:26:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:14,917 INFO L225 Difference]: With dead ends: 1251 [2019-03-04 16:26:14,917 INFO L226 Difference]: Without dead ends: 1247 [2019-03-04 16:26:14,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:26:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-03-04 16:26:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1169. [2019-03-04 16:26:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2019-03-04 16:26:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 8021 transitions. [2019-03-04 16:26:15,263 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 8021 transitions. Word has length 6 [2019-03-04 16:26:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:15,263 INFO L480 AbstractCegarLoop]: Abstraction has 1169 states and 8021 transitions. [2019-03-04 16:26:15,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:26:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 8021 transitions. [2019-03-04 16:26:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:15,265 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:15,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:15,265 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-03-04 16:26:15,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:15,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:15,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:15,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:15,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:15,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:15,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:15,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:15,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:15,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:15,529 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:26:15,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:15,535 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 21 treesize of output 24 [2019-03-04 16:26:15,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,542 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 24 treesize of output 26 [2019-03-04 16:26:15,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,551 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 26 treesize of output 28 [2019-03-04 16:26:15,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,567 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 28 treesize of output 30 [2019-03-04 16:26:15,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:15,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,634 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:15,634 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,649 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,669 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,684 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,704 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,720 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,793 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:15,793 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,802 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,816 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,832 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,851 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,879 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,923 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:15,923 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:26:15,959 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:15,960 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,002 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:16,003 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:26:16,043 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:26:16,044 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,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:16,117 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:26:16,174 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:16,175 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,200 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:16,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:26:16,270 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:26:16,271 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,296 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:16,296 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:53 [2019-03-04 16:26:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:16,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:16,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:16,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:16,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:16,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:16,344 INFO L87 Difference]: Start difference. First operand 1169 states and 8021 transitions. Second operand 12 states. [2019-03-04 16:26:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:17,715 INFO L93 Difference]: Finished difference Result 1956 states and 13091 transitions. [2019-03-04 16:26:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:26:17,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:26:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:17,726 INFO L225 Difference]: With dead ends: 1956 [2019-03-04 16:26:17,726 INFO L226 Difference]: Without dead ends: 1955 [2019-03-04 16:26:17,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:26:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2019-03-04 16:26:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1528. [2019-03-04 16:26:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-03-04 16:26:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 10532 transitions. [2019-03-04 16:26:18,221 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 10532 transitions. Word has length 6 [2019-03-04 16:26:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:18,221 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 10532 transitions. [2019-03-04 16:26:18,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 10532 transitions. [2019-03-04 16:26:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:18,223 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:18,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:18,223 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-03-04 16:26:18,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:18,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:18,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:18,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:18,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:18,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:18,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:18,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:18,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:26:18,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:18,355 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:18,356 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,366 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,386 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,407 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,437 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,471 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,508 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:18,512 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:26:18,515 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 26 treesize of output 28 [2019-03-04 16:26:18,519 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 28 treesize of output 30 [2019-03-04 16:26:18,523 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:18,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:18,527 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,539 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,551 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,563 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,575 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,586 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,630 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:18,630 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:26:18,662 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:18,662 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,704 INFO L309 ElimStorePlain]: Start of recursive call 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:18,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:26:18,746 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:26:18,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,777 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:18,777 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-03-04 16:26:18,838 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 41 treesize of output 46 [2019-03-04 16:26:18,838 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:18,862 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:18,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:49 [2019-03-04 16:26:18,887 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:18,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:18,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:18,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:18,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:18,905 INFO L87 Difference]: Start difference. First operand 1528 states and 10532 transitions. Second operand 10 states. [2019-03-04 16:26:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:19,946 INFO L93 Difference]: Finished difference Result 1612 states and 10874 transitions. [2019-03-04 16:26:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:19,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:19,955 INFO L225 Difference]: With dead ends: 1612 [2019-03-04 16:26:19,955 INFO L226 Difference]: Without dead ends: 1609 [2019-03-04 16:26:19,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2019-03-04 16:26:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1570. [2019-03-04 16:26:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-03-04 16:26:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 10826 transitions. [2019-03-04 16:26:20,536 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 10826 transitions. Word has length 6 [2019-03-04 16:26:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:20,536 INFO L480 AbstractCegarLoop]: Abstraction has 1570 states and 10826 transitions. [2019-03-04 16:26:20,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 10826 transitions. [2019-03-04 16:26:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:20,538 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:20,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:20,539 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash 893710716, now seen corresponding path program 1 times [2019-03-04 16:26:20,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:20,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:20,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:20,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:20,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:20,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:20,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:20,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:20,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:20,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:20,687 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 21 treesize of output 24 [2019-03-04 16:26:20,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:26:20,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,703 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 26 treesize of output 28 [2019-03-04 16:26:20,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,719 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 28 treesize of output 30 [2019-03-04 16:26:20,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,728 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,732 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,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,740 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,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,744 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 30 treesize of output 32 [2019-03-04 16:26:20,749 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,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,760 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,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:20,823 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,838 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,853 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,868 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,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:20,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:20,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:20,961 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,983 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,042 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,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:21,071 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,103 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:21,104 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:26:21,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:21,147 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,176 INFO L309 ElimStorePlain]: Start of recursive call 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:21,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:26:21,213 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:26:21,213 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,233 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:21,233 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:26:21,284 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:26:21,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,305 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:21,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:36 [2019-03-04 16:26:21,332 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:21,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:21,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:21,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:21,351 INFO L87 Difference]: Start difference. First operand 1570 states and 10826 transitions. Second operand 10 states. [2019-03-04 16:26:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:22,434 INFO L93 Difference]: Finished difference Result 1838 states and 12430 transitions. [2019-03-04 16:26:22,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:22,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:22,441 INFO L225 Difference]: With dead ends: 1838 [2019-03-04 16:26:22,441 INFO L226 Difference]: Without dead ends: 1837 [2019-03-04 16:26:22,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-03-04 16:26:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1630. [2019-03-04 16:26:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-03-04 16:26:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 11248 transitions. [2019-03-04 16:26:22,882 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 11248 transitions. Word has length 6 [2019-03-04 16:26:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:22,882 INFO L480 AbstractCegarLoop]: Abstraction has 1630 states and 11248 transitions. [2019-03-04 16:26:22,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 11248 transitions. [2019-03-04 16:26:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:22,884 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:22,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:22,885 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-03-04 16:26:22,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:22,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:22,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:22,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:22,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:22,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:22,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:22,971 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 21 treesize of output 24 [2019-03-04 16:26:22,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,975 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 24 treesize of output 26 [2019-03-04 16:26:22,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,984 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 26 treesize of output 28 [2019-03-04 16:26:22,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,002 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 28 treesize of output 30 [2019-03-04 16:26:23,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,019 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 30 treesize of output 32 [2019-03-04 16:26:23,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:23,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:23,069 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,082 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,094 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,107 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,119 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,132 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,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:23,173 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,175 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,183 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,196 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,213 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,244 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:23,245 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:26:23,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:23,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,322 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:23,323 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:26:23,359 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:26:23,360 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,381 INFO L309 ElimStorePlain]: Start of recursive call 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:23,381 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:26:23,431 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:26:23,431 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,449 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:23,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:23,474 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:23,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:23,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:26:23,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:23,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:23,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:23,492 INFO L87 Difference]: Start difference. First operand 1630 states and 11248 transitions. Second operand 9 states. [2019-03-04 16:26:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:24,472 INFO L93 Difference]: Finished difference Result 1665 states and 11300 transitions. [2019-03-04 16:26:24,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:24,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:26:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:24,479 INFO L225 Difference]: With dead ends: 1665 [2019-03-04 16:26:24,479 INFO L226 Difference]: Without dead ends: 1664 [2019-03-04 16:26:24,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-03-04 16:26:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1632. [2019-03-04 16:26:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2019-03-04 16:26:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 11262 transitions. [2019-03-04 16:26:24,952 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 11262 transitions. Word has length 6 [2019-03-04 16:26:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:24,952 INFO L480 AbstractCegarLoop]: Abstraction has 1632 states and 11262 transitions. [2019-03-04 16:26:24,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:26:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 11262 transitions. [2019-03-04 16:26:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:24,956 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:24,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:24,956 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-03-04 16:26:24,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:24,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:24,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:24,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:25,065 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,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:25,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:25,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:25,079 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:25,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:25,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:25,117 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,124 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,136 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,152 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,178 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,210 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 21 treesize of output 24 [2019-03-04 16:26:25,227 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:25,234 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:25,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:25,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:25,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:25,254 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,264 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,277 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,289 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,302 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,314 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,358 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:25,358 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:26:25,576 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 41 treesize of output 43 [2019-03-04 16:26:25,577 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:25,681 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:25,681 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-03-04 16:26:25,779 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:25,779 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,806 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:25,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:40 [2019-03-04 16:26:25,826 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:25,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:25,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:25,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:25,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:25,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:25,844 INFO L87 Difference]: Start difference. First operand 1632 states and 11262 transitions. Second operand 8 states. [2019-03-04 16:26:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:26,632 INFO L93 Difference]: Finished difference Result 1698 states and 11556 transitions. [2019-03-04 16:26:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:26,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:26:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:26,637 INFO L225 Difference]: With dead ends: 1698 [2019-03-04 16:26:26,637 INFO L226 Difference]: Without dead ends: 1697 [2019-03-04 16:26:26,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-03-04 16:26:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1667. [2019-03-04 16:26:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-03-04 16:26:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 11518 transitions. [2019-03-04 16:26:27,125 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 11518 transitions. Word has length 6 [2019-03-04 16:26:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:27,125 INFO L480 AbstractCegarLoop]: Abstraction has 1667 states and 11518 transitions. [2019-03-04 16:26:27,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 11518 transitions. [2019-03-04 16:26:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:27,127 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:27,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:27,128 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-03-04 16:26:27,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:27,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:27,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:27,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:27,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:27,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:27,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:27,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:27,203 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:27,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:27,209 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:27,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,221 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 24 treesize of output 26 [2019-03-04 16:26:27,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,230 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:27,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,246 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:27,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,262 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 30 treesize of output 32 [2019-03-04 16:26:27,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,313 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:27,314 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,326 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,383 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,402 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,414 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,427 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,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:27,472 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,474 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,481 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,491 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,509 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,541 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:27,541 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:26:27,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, 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:26:27,641 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:27,700 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:27,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-03-04 16:26:27,853 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 65 treesize of output 95 [2019-03-04 16:26:27,857 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:26:28,132 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 83 [2019-03-04 16:26:28,132 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,281 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-03-04 16:26:28,282 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:284 [2019-03-04 16:26:28,469 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-03-04 16:26:28,505 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:26:28,506 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:26:28,648 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2019-03-04 16:26:28,749 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:26:28,881 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,957 INFO L309 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-03-04 16:26:28,957 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-03-04 16:26:29,098 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-03-04 16:26:29,103 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,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:29,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:29,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:29,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:29,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:29,121 INFO L87 Difference]: Start difference. First operand 1667 states and 11518 transitions. Second operand 10 states. [2019-03-04 16:26:29,293 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-03-04 16:26:29,514 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-03-04 16:26:29,850 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-03-04 16:26:30,520 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-03-04 16:26:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:30,897 INFO L93 Difference]: Finished difference Result 1754 states and 11825 transitions. [2019-03-04 16:26:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:30,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:30,903 INFO L225 Difference]: With dead ends: 1754 [2019-03-04 16:26:30,903 INFO L226 Difference]: Without dead ends: 1753 [2019-03-04 16:26:30,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:26:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2019-03-04 16:26:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1703. [2019-03-04 16:26:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-03-04 16:26:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 11770 transitions. [2019-03-04 16:26:31,385 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 11770 transitions. Word has length 6 [2019-03-04 16:26:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:31,385 INFO L480 AbstractCegarLoop]: Abstraction has 1703 states and 11770 transitions. [2019-03-04 16:26:31,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 11770 transitions. [2019-03-04 16:26:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:31,388 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:31,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:31,388 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 2 times [2019-03-04 16:26:31,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:31,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:31,754 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,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:31,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:31,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:31,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:31,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:31,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:26:31,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:31,818 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:31,818 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,830 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,849 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,871 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,897 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,930 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,973 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 21 treesize of output 24 [2019-03-04 16:26:31,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:26:31,980 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 26 treesize of output 28 [2019-03-04 16:26:31,984 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 28 treesize of output 30 [2019-03-04 16:26:31,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:31,992 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:31,992 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,003 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,016 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,028 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,040 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,050 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,095 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,095 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:26:32,125 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,125 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,169 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,169 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:26:32,207 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:26:32,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,241 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,242 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:26:32,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, 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:32,319 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,347 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,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-03-04 16:26:32,368 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,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:32,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:32,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:32,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:32,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:32,389 INFO L87 Difference]: Start difference. First operand 1703 states and 11770 transitions. Second operand 10 states. [2019-03-04 16:26:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:33,524 INFO L93 Difference]: Finished difference Result 1896 states and 12835 transitions. [2019-03-04 16:26:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:33,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:33,530 INFO L225 Difference]: With dead ends: 1896 [2019-03-04 16:26:33,530 INFO L226 Difference]: Without dead ends: 1894 [2019-03-04 16:26:33,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-03-04 16:26:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1798. [2019-03-04 16:26:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2019-03-04 16:26:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 12428 transitions. [2019-03-04 16:26:34,068 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 12428 transitions. Word has length 6 [2019-03-04 16:26:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:34,068 INFO L480 AbstractCegarLoop]: Abstraction has 1798 states and 12428 transitions. [2019-03-04 16:26:34,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 12428 transitions. [2019-03-04 16:26:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:34,071 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:34,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:34,071 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-03-04 16:26:34,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:34,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:34,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:34,156 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:34,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:34,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:34,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:34,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:26:34,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:34,211 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:34,212 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,228 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,245 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,268 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,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:34,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:34,314 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:34,319 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:34,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:34,394 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:34,394 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,406 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,417 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,428 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,440 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,451 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,482 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,482 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:26:34,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:26:34,526 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:34,570 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:34,571 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:26:34,644 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 58 [2019-03-04 16:26:34,645 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,723 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:26:34,724 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,759 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:34,760 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-03-04 16:26:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:36,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:36,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:36,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:36,810 INFO L87 Difference]: Start difference. First operand 1798 states and 12428 transitions. Second operand 8 states. [2019-03-04 16:26:37,555 WARN L181 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-03-04 16:26:37,814 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-03-04 16:26:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:40,848 INFO L93 Difference]: Finished difference Result 1859 states and 12669 transitions. [2019-03-04 16:26:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:40,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:26:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:40,853 INFO L225 Difference]: With dead ends: 1859 [2019-03-04 16:26:40,854 INFO L226 Difference]: Without dead ends: 1858 [2019-03-04 16:26:40,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2019-03-04 16:26:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1826. [2019-03-04 16:26:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2019-03-04 16:26:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 12635 transitions. [2019-03-04 16:26:41,415 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 12635 transitions. Word has length 6 [2019-03-04 16:26:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:41,415 INFO L480 AbstractCegarLoop]: Abstraction has 1826 states and 12635 transitions. [2019-03-04 16:26:41,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 12635 transitions. [2019-03-04 16:26:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:41,418 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:41,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:41,419 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash 893472388, now seen corresponding path program 1 times [2019-03-04 16:26:41,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:41,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:41,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:41,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:41,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:41,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:41,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:41,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:41,572 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:41,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:41,604 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:41,604 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,617 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,628 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,637 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,656 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:41,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:26:41,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:41,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:41,693 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:41,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:41,731 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,742 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,754 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,766 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,777 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,789 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,821 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:41,822 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-03-04 16:26:41,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:41,856 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,884 INFO L309 ElimStorePlain]: Start of recursive call 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:41,885 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:26:41,919 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:26:41,920 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:41,942 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:41,942 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:26:42,256 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:26:42,256 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,273 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:42,273 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:36 [2019-03-04 16:26:42,293 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:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:42,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:42,312 INFO L87 Difference]: Start difference. First operand 1826 states and 12635 transitions. Second operand 10 states. [2019-03-04 16:26:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:43,545 INFO L93 Difference]: Finished difference Result 2235 states and 15239 transitions. [2019-03-04 16:26:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:43,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:26:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:43,554 INFO L225 Difference]: With dead ends: 2235 [2019-03-04 16:26:43,554 INFO L226 Difference]: Without dead ends: 2234 [2019-03-04 16:26:43,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-03-04 16:26:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1877. [2019-03-04 16:26:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-03-04 16:26:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 12996 transitions. [2019-03-04 16:26:44,185 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 12996 transitions. Word has length 6 [2019-03-04 16:26:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:44,185 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 12996 transitions. [2019-03-04 16:26:44,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 12996 transitions. [2019-03-04 16:26:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:44,189 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:44,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:44,189 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-03-04 16:26:44,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:44,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:44,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:44,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:44,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:44,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:26:44,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:44,346 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:44,346 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,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:44,357 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,374 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,397 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,432 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,471 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 21 treesize of output 24 [2019-03-04 16:26:44,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:26:44,478 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 26 treesize of output 28 [2019-03-04 16:26:44,482 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 28 treesize of output 30 [2019-03-04 16:26:44,484 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:44,488 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:44,489 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,500 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,512 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,524 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,535 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,546 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,589 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,590 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:26:44,629 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:44,630 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,674 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,674 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:26:44,721 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:26:44,722 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,750 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:26:44,812 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:44,813 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,837 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:26:44,914 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:26:44,915 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,938 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:44,938 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:53 [2019-03-04 16:26:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:45,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:45,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:45,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:45,019 INFO L87 Difference]: Start difference. First operand 1877 states and 12996 transitions. Second operand 12 states. [2019-03-04 16:26:46,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:46,521 INFO L93 Difference]: Finished difference Result 1980 states and 13399 transitions. [2019-03-04 16:26:46,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:46,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:26:46,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:46,528 INFO L225 Difference]: With dead ends: 1980 [2019-03-04 16:26:46,529 INFO L226 Difference]: Without dead ends: 1979 [2019-03-04 16:26:46,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:26:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-03-04 16:26:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1910. [2019-03-04 16:26:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-03-04 16:26:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 13227 transitions. [2019-03-04 16:26:47,105 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 13227 transitions. Word has length 6 [2019-03-04 16:26:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:47,105 INFO L480 AbstractCegarLoop]: Abstraction has 1910 states and 13227 transitions. [2019-03-04 16:26:47,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 13227 transitions. [2019-03-04 16:26:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:47,108 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:47,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:47,108 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-03-04 16:26:47,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:47,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:47,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:47,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:47,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:47,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:47,227 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:26:47,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:47,235 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:47,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,238 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 24 treesize of output 26 [2019-03-04 16:26:47,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,245 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:47,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,257 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 28 treesize of output 30 [2019-03-04 16:26:47,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:47,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:47,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:47,327 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,341 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,354 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,368 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,381 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,395 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:47,439 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,441 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,451 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,464 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,482 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,515 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:47,516 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-03-04 16:26:47,583 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:47,584 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,613 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:47,613 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-03-04 16:26:47,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:26:47,655 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,676 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:47,676 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:40 [2019-03-04 16:26:47,727 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:26:47,728 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,747 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:47,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 16:26:47,806 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 48 [2019-03-04 16:26:47,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,820 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:47,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:47,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:47,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:47,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:47,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:47,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:47,862 INFO L87 Difference]: Start difference. First operand 1910 states and 13227 transitions. Second operand 12 states. [2019-03-04 16:26:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:49,287 INFO L93 Difference]: Finished difference Result 2011 states and 13610 transitions. [2019-03-04 16:26:49,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:49,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:26:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:49,295 INFO L225 Difference]: With dead ends: 2011 [2019-03-04 16:26:49,295 INFO L226 Difference]: Without dead ends: 2009 [2019-03-04 16:26:49,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:26:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-03-04 16:26:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1952. [2019-03-04 16:26:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-03-04 16:26:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 13519 transitions. [2019-03-04 16:26:49,893 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 13519 transitions. Word has length 6 [2019-03-04 16:26:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:49,893 INFO L480 AbstractCegarLoop]: Abstraction has 1952 states and 13519 transitions. [2019-03-04 16:26:49,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 13519 transitions. [2019-03-04 16:26:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:49,896 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:49,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:49,896 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:49,896 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 1 times [2019-03-04 16:26:49,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:49,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:50,109 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-03-04 16:26:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:50,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:50,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:50,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:50,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:26:50,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:50,166 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 21 treesize of output 24 [2019-03-04 16:26:50,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,170 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 24 treesize of output 26 [2019-03-04 16:26:50,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,178 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 26 treesize of output 28 [2019-03-04 16:26:50,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,190 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 28 treesize of output 30 [2019-03-04 16:26:50,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:50,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:50,232 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,244 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,258 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,271 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,283 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,296 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,353 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:50,354 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,357 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,369 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,389 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,416 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,445 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,492 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:50,492 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:26:50,567 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:50,568 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,751 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:50,752 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:26:50,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, 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:26:50,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,842 INFO L309 ElimStorePlain]: Start of recursive call 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:50,842 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:26:50,899 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:50,900 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,926 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,926 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-03-04 16:26:51,004 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:26:51,005 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:51,026 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:51,026 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:47 [2019-03-04 16:26:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:51,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:51,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:51,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:51,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:51,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:51,070 INFO L87 Difference]: Start difference. First operand 1952 states and 13519 transitions. Second operand 12 states. [2019-03-04 16:26:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:52,669 INFO L93 Difference]: Finished difference Result 2031 states and 13751 transitions. [2019-03-04 16:26:52,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:52,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:26:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:52,678 INFO L225 Difference]: With dead ends: 2031 [2019-03-04 16:26:52,678 INFO L226 Difference]: Without dead ends: 2028 [2019-03-04 16:26:52,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:26:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2019-03-04 16:26:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1969. [2019-03-04 16:26:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-03-04 16:26:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 13638 transitions. [2019-03-04 16:26:53,320 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 13638 transitions. Word has length 6 [2019-03-04 16:26:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:53,321 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 13638 transitions. [2019-03-04 16:26:53,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 13638 transitions. [2019-03-04 16:26:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:53,324 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:53,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:53,324 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:53,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:53,324 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-03-04 16:26:53,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:53,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:53,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:53,474 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:26:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:53,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:53,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:53,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:26:53,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:53,588 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:53,588 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,590 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,596 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,609 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,627 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,664 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 21 treesize of output 24 [2019-03-04 16:26:53,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:26:53,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:53,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:53,674 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 30 treesize of output 32 [2019-03-04 16:26:53,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:26:53,711 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,723 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,735 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,747 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,759 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,769 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,802 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:53,802 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:26:53,919 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:26:53,920 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:53,970 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:53,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-03-04 16:26:54,115 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 65 treesize of output 74 [2019-03-04 16:26:54,117 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:54,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2019-03-04 16:26:54,248 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,325 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-03-04 16:26:54,326 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-03-04 16:26:54,474 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 60 [2019-03-04 16:26:54,474 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 53 [2019-03-04 16:26:54,585 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,701 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 57 treesize of output 69 [2019-03-04 16:26:54,702 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:54,805 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-03-04 16:26:54,805 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:153 [2019-03-04 16:26:54,979 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 46 treesize of output 57 [2019-03-04 16:26:54,980 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 62 [2019-03-04 16:26:55,118 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 16:26:55,254 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 51 treesize of output 77 [2019-03-04 16:26:55,410 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-03-04 16:26:55,549 INFO L309 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-03-04 16:26:55,549 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:240 [2019-03-04 16:26:55,803 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-03-04 16:26:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:55,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:55,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:55,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:55,825 INFO L87 Difference]: Start difference. First operand 1969 states and 13638 transitions. Second operand 12 states. [2019-03-04 16:26:56,004 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-03-04 16:26:56,267 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-03-04 16:26:56,734 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-03-04 16:26:57,148 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-03-04 16:26:57,945 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2019-03-04 16:26:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:59,031 INFO L93 Difference]: Finished difference Result 2156 states and 14468 transitions. [2019-03-04 16:26:59,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:59,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:26:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:59,040 INFO L225 Difference]: With dead ends: 2156 [2019-03-04 16:26:59,040 INFO L226 Difference]: Without dead ends: 2154 [2019-03-04 16:26:59,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:26:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-03-04 16:26:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2002. [2019-03-04 16:26:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-03-04 16:26:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 13869 transitions. [2019-03-04 16:26:59,777 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 13869 transitions. Word has length 6 [2019-03-04 16:26:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:59,777 INFO L480 AbstractCegarLoop]: Abstraction has 2002 states and 13869 transitions. [2019-03-04 16:26:59,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 13869 transitions. [2019-03-04 16:26:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:26:59,780 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:59,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:26:59,780 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash 908563996, now seen corresponding path program 1 times [2019-03-04 16:26:59,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:59,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:59,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:59,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:59,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:59,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:59,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:59,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:26:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:26:59,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:26:59,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:26:59,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:26:59,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:26:59,934 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,947 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,960 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,973 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,986 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,999 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,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:00,048 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,054 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,063 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,081 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,106 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,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:27:00,147 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:27:00,174 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:00,175 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,214 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,214 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-03-04 16:27:00,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, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:27:00,253 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,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:27:00,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:53 [2019-03-04 16:27:00,374 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:00,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:00,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:00,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:00,393 INFO L87 Difference]: Start difference. First operand 2002 states and 13869 transitions. Second operand 8 states. [2019-03-04 16:27:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:01,351 INFO L93 Difference]: Finished difference Result 2034 states and 13900 transitions. [2019-03-04 16:27:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:01,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:27:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:01,358 INFO L225 Difference]: With dead ends: 2034 [2019-03-04 16:27:01,358 INFO L226 Difference]: Without dead ends: 2033 [2019-03-04 16:27:01,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-03-04 16:27:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2002. [2019-03-04 16:27:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-03-04 16:27:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 13869 transitions. [2019-03-04 16:27:01,980 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 13869 transitions. Word has length 6 [2019-03-04 16:27:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:01,980 INFO L480 AbstractCegarLoop]: Abstraction has 2002 states and 13869 transitions. [2019-03-04 16:27:01,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 13869 transitions. [2019-03-04 16:27:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:01,983 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:01,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:01,984 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-03-04 16:27:01,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:01,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:01,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:02,069 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,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:02,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:02,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:02,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:27:02,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:02,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:02,175 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,183 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,199 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,218 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,250 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:02,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:02,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:02,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:02,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:02,433 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:02,434 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,444 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,455 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,467 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,478 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,490 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,531 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:02,531 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:27:02,565 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:02,565 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,604 INFO L309 ElimStorePlain]: Start of recursive call 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:02,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-03-04 16:27:02,646 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:27:02,647 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,673 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:02,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:53 [2019-03-04 16:27:02,727 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:27:02,728 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:02,748 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:02,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-03-04 16:27:02,771 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,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:02,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:02,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:02,789 INFO L87 Difference]: Start difference. First operand 2002 states and 13869 transitions. Second operand 10 states. [2019-03-04 16:27:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:04,033 INFO L93 Difference]: Finished difference Result 2049 states and 13933 transitions. [2019-03-04 16:27:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:04,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:27:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:04,041 INFO L225 Difference]: With dead ends: 2049 [2019-03-04 16:27:04,041 INFO L226 Difference]: Without dead ends: 2048 [2019-03-04 16:27:04,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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:27:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-03-04 16:27:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2004. [2019-03-04 16:27:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2019-03-04 16:27:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 13883 transitions. [2019-03-04 16:27:04,633 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 13883 transitions. Word has length 6 [2019-03-04 16:27:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:04,633 INFO L480 AbstractCegarLoop]: Abstraction has 2004 states and 13883 transitions. [2019-03-04 16:27:04,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 13883 transitions. [2019-03-04 16:27:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:04,636 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:04,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:04,636 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash 908146922, now seen corresponding path program 1 times [2019-03-04 16:27:04,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:04,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:04,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:04,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:04,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:04,694 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:04,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:04,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:04,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:04,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:04,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:04,735 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 21 treesize of output 24 [2019-03-04 16:27:04,744 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:04,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,752 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:04,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:04,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:04,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:04,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:27:04,833 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,844 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,857 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,868 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,881 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,894 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,932 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:04,932 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,937 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,946 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,961 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,989 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:04,990 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:27:05,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:05,029 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,055 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:05,055 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:27:05,097 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:27:05,097 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:05,133 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:05,133 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-03-04 16:27:05,164 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:05,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:05,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:05,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:05,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:05,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:05,183 INFO L87 Difference]: Start difference. First operand 2004 states and 13883 transitions. Second operand 8 states. [2019-03-04 16:27:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:06,086 INFO L93 Difference]: Finished difference Result 2032 states and 13910 transitions. [2019-03-04 16:27:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:06,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:27:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:06,093 INFO L225 Difference]: With dead ends: 2032 [2019-03-04 16:27:06,093 INFO L226 Difference]: Without dead ends: 2031 [2019-03-04 16:27:06,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-03-04 16:27:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2004. [2019-03-04 16:27:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2019-03-04 16:27:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 13883 transitions. [2019-03-04 16:27:06,751 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 13883 transitions. Word has length 6 [2019-03-04 16:27:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:06,751 INFO L480 AbstractCegarLoop]: Abstraction has 2004 states and 13883 transitions. [2019-03-04 16:27:06,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 13883 transitions. [2019-03-04 16:27:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:06,754 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:06,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:06,755 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:06,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash 910214494, now seen corresponding path program 1 times [2019-03-04 16:27:06,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:06,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:06,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:06,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:06,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:06,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:06,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:06,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:27:06,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:06,907 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,908 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,920 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,940 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,967 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,997 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,032 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,071 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 21 treesize of output 24 [2019-03-04 16:27:07,074 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 24 treesize of output 26 [2019-03-04 16:27:07,078 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:07,081 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 28 treesize of output 30 [2019-03-04 16:27:07,085 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 30 treesize of output 32 [2019-03-04 16:27:07,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:07,089 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,100 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,112 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,123 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,135 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,147 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,190 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:07,191 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:27:07,233 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,234 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,275 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:07,276 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:27:07,323 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:27:07,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,355 INFO L309 ElimStorePlain]: Start of recursive call 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:07,356 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:63 [2019-03-04 16:27:07,423 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:27:07,424 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,452 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:07,452 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:61 [2019-03-04 16:27:07,525 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 4 new quantified variables, introduced 15 case distinctions, treesize of input 47 treesize of output 55 [2019-03-04 16:27:07,526 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,549 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,549 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:71, output treesize:53 [2019-03-04 16:27:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:07,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:07,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:27:07,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:27:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:27:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:07,597 INFO L87 Difference]: Start difference. First operand 2004 states and 13883 transitions. Second operand 12 states. [2019-03-04 16:27:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:08,935 INFO L93 Difference]: Finished difference Result 2058 states and 13946 transitions. [2019-03-04 16:27:08,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:08,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:27:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:08,944 INFO L225 Difference]: With dead ends: 2058 [2019-03-04 16:27:08,944 INFO L226 Difference]: Without dead ends: 2056 [2019-03-04 16:27:08,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:27:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-03-04 16:27:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2005. [2019-03-04 16:27:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-03-04 16:27:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 13874 transitions. [2019-03-04 16:27:09,530 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 13874 transitions. Word has length 6 [2019-03-04 16:27:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:09,530 INFO L480 AbstractCegarLoop]: Abstraction has 2005 states and 13874 transitions. [2019-03-04 16:27:09,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:27:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 13874 transitions. [2019-03-04 16:27:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:09,534 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:09,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:09,534 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-03-04 16:27:09,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:09,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:09,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:09,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:09,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:09,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:09,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:09,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:09,660 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,669 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,684 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,707 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,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:09,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:09,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:09,752 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:09,757 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:09,797 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:27:09,798 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,808 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,818 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,830 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,842 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,854 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,883 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:09,884 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:27:10,074 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-03-04 16:27:10,122 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 41 treesize of output 71 [2019-03-04 16:27:10,128 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:27:10,375 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-03-04 16:27:10,375 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:437 [2019-03-04 16:27:10,583 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:27:10,584 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,709 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 67 [2019-03-04 16:27:10,711 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:10,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 67 [2019-03-04 16:27:10,849 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:10,973 INFO L309 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-03-04 16:27:10,973 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:198, output treesize:198 [2019-03-04 16:27:11,099 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 16:27:11,100 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,182 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:27:11,183 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,256 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:27:11,257 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,299 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:27:11,299 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:136, output treesize:92 [2019-03-04 16:27:11,380 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:11,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:11,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:11,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:11,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:11,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:11,399 INFO L87 Difference]: Start difference. First operand 2005 states and 13874 transitions. Second operand 10 states. [2019-03-04 16:27:11,805 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-03-04 16:27:12,505 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-03-04 16:27:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:13,362 INFO L93 Difference]: Finished difference Result 2127 states and 14352 transitions. [2019-03-04 16:27:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:13,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:27:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:13,370 INFO L225 Difference]: With dead ends: 2127 [2019-03-04 16:27:13,371 INFO L226 Difference]: Without dead ends: 2124 [2019-03-04 16:27:13,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2019-03-04 16:27:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2006. [2019-03-04 16:27:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-03-04 16:27:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 13863 transitions. [2019-03-04 16:27:13,979 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 13863 transitions. Word has length 6 [2019-03-04 16:27:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:13,980 INFO L480 AbstractCegarLoop]: Abstraction has 2006 states and 13863 transitions. [2019-03-04 16:27:13,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 13863 transitions. [2019-03-04 16:27:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:13,983 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:13,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:13,984 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-03-04 16:27:13,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:13,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:13,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:14,043 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:14,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:14,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:14,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:14,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:14,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:14,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:14,106 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,116 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,136 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,161 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,191 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,233 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 21 treesize of output 24 [2019-03-04 16:27:14,245 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:14,251 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:14,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, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:14,262 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:14,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:14,268 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,279 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,290 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,302 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,313 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,325 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,367 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:14,367 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:27:14,392 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:14,393 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,432 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:14,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:27:14,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:27:14,480 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:14,537 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:27:14,537 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:122 [2019-03-04 16:27:14,586 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,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:14,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:14,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:14,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:14,604 INFO L87 Difference]: Start difference. First operand 2006 states and 13863 transitions. Second operand 8 states. [2019-03-04 16:27:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:15,564 INFO L93 Difference]: Finished difference Result 2030 states and 13897 transitions. [2019-03-04 16:27:15,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:15,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:27:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:15,571 INFO L225 Difference]: With dead ends: 2030 [2019-03-04 16:27:15,571 INFO L226 Difference]: Without dead ends: 2029 [2019-03-04 16:27:15,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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:27:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-03-04 16:27:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2006. [2019-03-04 16:27:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-03-04 16:27:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 13863 transitions. [2019-03-04 16:27:16,213 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 13863 transitions. Word has length 6 [2019-03-04 16:27:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:16,213 INFO L480 AbstractCegarLoop]: Abstraction has 2006 states and 13863 transitions. [2019-03-04 16:27:16,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 13863 transitions. [2019-03-04 16:27:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:16,217 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:16,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:16,217 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 897298406, now seen corresponding path program 3 times [2019-03-04 16:27:16,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:16,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:16,392 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-03-04 16:27:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:16,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:16,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:16,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:16,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:27:16,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:16,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:27:16,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:16,509 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,510 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,515 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,524 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,542 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,562 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,591 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,625 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 21 treesize of output 24 [2019-03-04 16:27:16,629 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 24 treesize of output 26 [2019-03-04 16:27:16,634 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 26 treesize of output 28 [2019-03-04 16:27:16,664 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 28 treesize of output 30 [2019-03-04 16:27:16,694 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 30 treesize of output 32 [2019-03-04 16:27:16,719 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:16,720 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,896 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,056 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,238 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,405 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,565 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,991 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:17,991 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:27:18,026 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,027 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,069 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:18,069 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:27:18,111 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:27:18,111 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,141 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:18,141 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:27:18,201 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:27:18,201 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,228 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,228 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:61 [2019-03-04 16:27:18,293 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 4 new quantified variables, introduced 15 case distinctions, treesize of input 47 treesize of output 51 [2019-03-04 16:27:18,294 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,314 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,315 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:71, output treesize:53 [2019-03-04 16:27:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:18,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:18,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:27:18,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:27:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:27:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:18,353 INFO L87 Difference]: Start difference. First operand 2006 states and 13863 transitions. Second operand 12 states. [2019-03-04 16:27:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:19,723 INFO L93 Difference]: Finished difference Result 2223 states and 15097 transitions. [2019-03-04 16:27:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:19,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:27:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:19,732 INFO L225 Difference]: With dead ends: 2223 [2019-03-04 16:27:19,732 INFO L226 Difference]: Without dead ends: 2216 [2019-03-04 16:27:19,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:27:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2019-03-04 16:27:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2027. [2019-03-04 16:27:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-03-04 16:27:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 14027 transitions. [2019-03-04 16:27:20,344 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 14027 transitions. Word has length 6 [2019-03-04 16:27:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:20,344 INFO L480 AbstractCegarLoop]: Abstraction has 2027 states and 14027 transitions. [2019-03-04 16:27:20,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:27:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 14027 transitions. [2019-03-04 16:27:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:20,347 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:20,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:20,348 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:20,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 897302998, now seen corresponding path program 1 times [2019-03-04 16:27:20,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:20,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:20,389 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:20,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:20,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:20,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:20,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:20,433 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:20,433 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,441 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,452 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,469 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:20,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:20,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:20,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:20,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:20,566 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:27:20,567 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,577 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,589 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,601 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,613 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,624 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,654 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:20,654 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:27:20,701 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:27:20,702 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:20,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:20,745 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:27:20,779 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:20,780 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:20,796 INFO L309 ElimStorePlain]: Start of recursive call 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:20,796 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:33 [2019-03-04 16:27:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:20,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:20,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:27:20,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:27:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:27:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:27:20,831 INFO L87 Difference]: Start difference. First operand 2027 states and 14027 transitions. Second operand 7 states. [2019-03-04 16:27:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:21,696 INFO L93 Difference]: Finished difference Result 2052 states and 14053 transitions. [2019-03-04 16:27:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:21,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:27:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:21,704 INFO L225 Difference]: With dead ends: 2052 [2019-03-04 16:27:21,704 INFO L226 Difference]: Without dead ends: 2051 [2019-03-04 16:27:21,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:27:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2019-03-04 16:27:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2027. [2019-03-04 16:27:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-03-04 16:27:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 14027 transitions. [2019-03-04 16:27:22,374 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 14027 transitions. Word has length 6 [2019-03-04 16:27:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:22,374 INFO L480 AbstractCegarLoop]: Abstraction has 2027 states and 14027 transitions. [2019-03-04 16:27:22,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:27:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 14027 transitions. [2019-03-04 16:27:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:22,378 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:22,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:22,378 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 3 times [2019-03-04 16:27:22,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:22,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:22,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:22,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:22,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:22,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:22,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:27:22,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:22,486 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:27:22,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:22,491 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 21 treesize of output 24 [2019-03-04 16:27:22,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,502 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 24 treesize of output 26 [2019-03-04 16:27:22,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,515 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 26 treesize of output 28 [2019-03-04 16:27:22,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:22,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:22,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,573 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:22,574 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,587 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,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:22,614 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,627 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,639 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,696 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:22,696 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,698 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,705 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,720 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,742 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,770 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,816 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:22,816 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-03-04 16:27:22,844 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:22,845 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,888 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:22,889 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:27:22,927 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:27:22,928 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,960 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:22,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:27:23,013 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:23,014 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,039 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:23,040 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-03-04 16:27:23,067 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,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:23,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:23,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:23,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:23,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:23,087 INFO L87 Difference]: Start difference. First operand 2027 states and 14027 transitions. Second operand 10 states. [2019-03-04 16:27:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:24,637 INFO L93 Difference]: Finished difference Result 2952 states and 20114 transitions. [2019-03-04 16:27:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:24,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:27:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:24,647 INFO L225 Difference]: With dead ends: 2952 [2019-03-04 16:27:24,647 INFO L226 Difference]: Without dead ends: 2950 [2019-03-04 16:27:24,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-03-04 16:27:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2081. [2019-03-04 16:27:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-03-04 16:27:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 14416 transitions. [2019-03-04 16:27:25,329 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 14416 transitions. Word has length 6 [2019-03-04 16:27:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:25,329 INFO L480 AbstractCegarLoop]: Abstraction has 2081 states and 14416 transitions. [2019-03-04 16:27:25,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 14416 transitions. [2019-03-04 16:27:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:25,332 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:25,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:25,332 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash 897178004, now seen corresponding path program 1 times [2019-03-04 16:27:25,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:25,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:25,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:25,424 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:25,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:25,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:25,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:25,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:25,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:25,448 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:25,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:25,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:25,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,481 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:25,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:25,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:25,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:27:25,548 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,561 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,574 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,586 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,599 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,611 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,648 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:25,649 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,656 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,669 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,685 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,714 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:25,715 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:27:25,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:27:25,766 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:25,808 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:25,808 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 16:27:25,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:27:25,874 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,887 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:25,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:27 [2019-03-04 16:27:25,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:27:25,926 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,937 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:25,937 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:27:25,954 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:25,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:25,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:25,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:25,974 INFO L87 Difference]: Start difference. First operand 2081 states and 14416 transitions. Second operand 10 states. [2019-03-04 16:27:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:27,242 INFO L93 Difference]: Finished difference Result 2295 states and 15605 transitions. [2019-03-04 16:27:27,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:27,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:27:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:27,250 INFO L225 Difference]: With dead ends: 2295 [2019-03-04 16:27:27,250 INFO L226 Difference]: Without dead ends: 2293 [2019-03-04 16:27:27,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-03-04 16:27:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2241. [2019-03-04 16:27:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2241 states. [2019-03-04 16:27:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 15546 transitions. [2019-03-04 16:27:27,997 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 15546 transitions. Word has length 6 [2019-03-04 16:27:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:27,997 INFO L480 AbstractCegarLoop]: Abstraction has 2241 states and 15546 transitions. [2019-03-04 16:27:27,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 15546 transitions. [2019-03-04 16:27:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:28,001 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:28,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:28,002 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-03-04 16:27:28,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:28,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:28,088 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:28,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:28,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:28,101 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:28,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:28,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:28,143 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,154 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,173 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,197 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,231 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,269 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 21 treesize of output 24 [2019-03-04 16:27:28,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:28,285 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:28,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:27:28,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:28,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:28,303 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,314 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,326 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,338 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,351 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,363 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,404 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:28,405 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-03-04 16:27:28,428 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:28,429 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,470 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:28,471 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-03-04 16:27:28,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:27:28,509 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,539 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:28,540 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:53 [2019-03-04 16:27:28,557 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:28,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:28,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:28,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:28,575 INFO L87 Difference]: Start difference. First operand 2241 states and 15546 transitions. Second operand 8 states. [2019-03-04 16:27:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:30,143 INFO L93 Difference]: Finished difference Result 3801 states and 26267 transitions. [2019-03-04 16:27:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:30,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:27:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:30,156 INFO L225 Difference]: With dead ends: 3801 [2019-03-04 16:27:30,156 INFO L226 Difference]: Without dead ends: 3800 [2019-03-04 16:27:30,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:27:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2019-03-04 16:27:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3700. [2019-03-04 16:27:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3700 states. [2019-03-04 16:27:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 25843 transitions. [2019-03-04 16:27:31,369 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 25843 transitions. Word has length 6 [2019-03-04 16:27:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:31,369 INFO L480 AbstractCegarLoop]: Abstraction has 3700 states and 25843 transitions. [2019-03-04 16:27:31,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 25843 transitions. [2019-03-04 16:27:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:27:31,374 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:31,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:27:31,375 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-03-04 16:27:31,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:31,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:31,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:31,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:31,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:31,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:31,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:31,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:31,507 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:27:31,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:31,512 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:31,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,521 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 24 treesize of output 26 [2019-03-04 16:27:31,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,529 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 26 treesize of output 28 [2019-03-04 16:27:31,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,542 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 28 treesize of output 30 [2019-03-04 16:27:31,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:31,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:31,581 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:31,582 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,615 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,629 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,642 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,654 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,668 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,723 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:31,724 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,728 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,733 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,747 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,768 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,796 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,842 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:31,842 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:27:31,875 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:31,875 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,917 INFO L309 ElimStorePlain]: Start of recursive call 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:31,917 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:31,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, 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:31,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:31,994 INFO L309 ElimStorePlain]: Start of recursive call 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:31,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-03-04 16:27:32,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, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 41 treesize of output 46 [2019-03-04 16:27:32,050 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:32,075 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:32,076 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:49 [2019-03-04 16:27:32,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, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:27:32,167 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:32,201 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:32,201 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:47 [2019-03-04 16:27:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:32,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:32,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:27:32,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:27:32,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:27:32,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:32,249 INFO L87 Difference]: Start difference. First operand 3700 states and 25843 transitions. Second operand 12 states. [2019-03-04 16:27:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:34,625 INFO L93 Difference]: Finished difference Result 4352 states and 29969 transitions. [2019-03-04 16:27:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:27:34,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:27:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:34,640 INFO L225 Difference]: With dead ends: 4352 [2019-03-04 16:27:34,640 INFO L226 Difference]: Without dead ends: 4346 [2019-03-04 16:27:34,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:27:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-03-04 16:27:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 3780. [2019-03-04 16:27:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-03-04 16:27:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 26403 transitions. [2019-03-04 16:27:35,932 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 26403 transitions. Word has length 6 [2019-03-04 16:27:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:35,932 INFO L480 AbstractCegarLoop]: Abstraction has 3780 states and 26403 transitions. [2019-03-04 16:27:35,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:27:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 26403 transitions. [2019-03-04 16:27:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:35,938 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:35,938 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:27:35,938 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2020006718, now seen corresponding path program 4 times [2019-03-04 16:27:35,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:35,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:35,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:36,287 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:27:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:36,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:36,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:36,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:27:36,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:27:36,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:36,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:36,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:36,489 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:36,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,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 24 treesize of output 26 [2019-03-04 16:27:36,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,502 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 26 treesize of output 28 [2019-03-04 16:27:36,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,513 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 28 treesize of output 30 [2019-03-04 16:27:36,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,555 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 30 treesize of output 32 [2019-03-04 16:27:36,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,603 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:27:36,604 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,615 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,626 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,638 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,651 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,663 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,703 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:36,704 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,708 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,717 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,732 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,750 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,781 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:36,781 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:27:36,878 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:36,879 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:36,933 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:36,934 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:113 [2019-03-04 16:27:37,045 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-03-04 16:27:37,112 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 89 [2019-03-04 16:27:37,113 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:37,220 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 62 treesize of output 81 [2019-03-04 16:27:37,221 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:37,278 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:37,278 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:130, output treesize:110 [2019-03-04 16:27:37,394 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-03-04 16:27:37,415 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 16:27:37,416 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:37,503 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:37,504 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:37,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-03-04 16:27:37,600 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:130, output treesize:129 [2019-03-04 16:27:37,774 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:27:37,775 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:37,899 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:27:37,900 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:38,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 55 treesize of output 81 [2019-03-04 16:27:38,034 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2019-03-04 16:27:38,190 INFO L309 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-03-04 16:27:38,190 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:156, output treesize:242 [2019-03-04 16:27:40,612 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 138 DAG size of output: 95 [2019-03-04 16:27:40,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 60 [2019-03-04 16:27:40,663 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:40,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:27:40,776 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:40,906 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 44 treesize of output 59 [2019-03-04 16:27:40,907 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 51 [2019-03-04 16:27:41,014 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,078 INFO L309 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-03-04 16:27:41,078 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:151 [2019-03-04 16:27:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:41,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:41,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:27:41,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:27:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:27:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:41,184 INFO L87 Difference]: Start difference. First operand 3780 states and 26403 transitions. Second operand 14 states. [2019-03-04 16:27:41,514 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-03-04 16:27:42,233 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 68 [2019-03-04 16:27:42,803 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-03-04 16:27:43,080 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2019-03-04 16:27:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:44,988 INFO L93 Difference]: Finished difference Result 4621 states and 31619 transitions. [2019-03-04 16:27:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:27:44,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:27:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:45,003 INFO L225 Difference]: With dead ends: 4621 [2019-03-04 16:27:45,004 INFO L226 Difference]: Without dead ends: 4620 [2019-03-04 16:27:45,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:27:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2019-03-04 16:27:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 3355. [2019-03-04 16:27:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3355 states. [2019-03-04 16:27:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 23415 transitions. [2019-03-04 16:27:46,217 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 23415 transitions. Word has length 7 [2019-03-04 16:27:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:46,217 INFO L480 AbstractCegarLoop]: Abstraction has 3355 states and 23415 transitions. [2019-03-04 16:27:46,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:27:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 23415 transitions. [2019-03-04 16:27:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:46,222 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:46,222 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:27:46,223 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2019487778, now seen corresponding path program 5 times [2019-03-04 16:27:46,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:46,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:46,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:46,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:46,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:46,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:46,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:46,359 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:27:46,366 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-03-04 16:27:46,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:46,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:46,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:46,372 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 21 treesize of output 24 [2019-03-04 16:27:46,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,380 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 24 treesize of output 26 [2019-03-04 16:27:46,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,386 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 26 treesize of output 28 [2019-03-04 16:27:46,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,397 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 28 treesize of output 30 [2019-03-04 16:27:46,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,412 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:46,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,483 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:27:46,483 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,497 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,509 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,522 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,534 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,547 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,625 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:46,625 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,632 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,641 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,655 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,672 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,705 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:46,705 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:27:46,806 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:46,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:46,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:46,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:113 [2019-03-04 16:27:46,975 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-03-04 16:27:47,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 62 treesize of output 81 [2019-03-04 16:27:47,028 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,143 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 77 [2019-03-04 16:27:47,144 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,192 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:47,192 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:130, output treesize:110 [2019-03-04 16:27:47,648 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-03-04 16:27:47,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, 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:47,711 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:27:47,997 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 62 treesize of output 73 [2019-03-04 16:27:47,998 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:48,138 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-03-04 16:27:48,138 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:130, output treesize:280 [2019-03-04 16:27:48,894 WARN L181 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 102 [2019-03-04 16:27:48,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, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:27:48,919 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,066 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 71 [2019-03-04 16:27:49,066 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,194 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 52 treesize of output 61 [2019-03-04 16:27:49,195 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 52 treesize of output 57 [2019-03-04 16:27:49,313 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,388 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-03-04 16:27:49,388 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:219, output treesize:161 [2019-03-04 16:27:49,513 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 16:27:49,514 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,655 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 60 [2019-03-04 16:27:49,656 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,792 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 44 treesize of output 59 [2019-03-04 16:27:49,792 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,900 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:27:49,900 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,965 INFO L309 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-03-04 16:27:49,965 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:151 [2019-03-04 16:27:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:50,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:50,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:27:50,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:27:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:27:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:50,070 INFO L87 Difference]: Start difference. First operand 3355 states and 23415 transitions. Second operand 13 states. [2019-03-04 16:27:50,397 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-03-04 16:27:50,717 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 57 [2019-03-04 16:27:51,085 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2019-03-04 16:27:51,669 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-03-04 16:27:52,820 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-03-04 16:27:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:53,289 INFO L93 Difference]: Finished difference Result 4190 states and 28887 transitions. [2019-03-04 16:27:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:27:53,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:27:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:53,303 INFO L225 Difference]: With dead ends: 4190 [2019-03-04 16:27:53,304 INFO L226 Difference]: Without dead ends: 4189 [2019-03-04 16:27:53,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:27:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2019-03-04 16:27:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 3368. [2019-03-04 16:27:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2019-03-04 16:27:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 23514 transitions. [2019-03-04 16:27:54,576 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 23514 transitions. Word has length 7 [2019-03-04 16:27:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:54,576 INFO L480 AbstractCegarLoop]: Abstraction has 3368 states and 23514 transitions. [2019-03-04 16:27:54,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:27:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 23514 transitions. [2019-03-04 16:27:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:54,581 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:54,581 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:27:54,582 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2019344862, now seen corresponding path program 1 times [2019-03-04 16:27:54,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:54,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:54,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:54,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:54,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:54,623 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:54,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:54,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:54,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:54,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:27:54,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:54,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:27:54,653 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,665 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:54,701 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:27:54,726 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 34 [2019-03-04 16:27:54,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 28 treesize of output 39 [2019-03-04 16:27:54,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:54,825 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:27:54,826 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,836 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,847 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,858 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,869 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,879 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:54,898 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:54,898 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:39, output treesize:47 [2019-03-04 16:27:54,950 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 52 [2019-03-04 16:27:54,951 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:27:55,047 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-03-04 16:27:55,048 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:241 [2019-03-04 16:27:55,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:27:55,110 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,114 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:55,114 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-03-04 16:27:55,125 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:55,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:55,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:55,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:55,145 INFO L87 Difference]: Start difference. First operand 3368 states and 23514 transitions. Second operand 8 states. [2019-03-04 16:27:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:57,323 INFO L93 Difference]: Finished difference Result 5277 states and 36779 transitions. [2019-03-04 16:27:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:57,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:27:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:57,340 INFO L225 Difference]: With dead ends: 5277 [2019-03-04 16:27:57,341 INFO L226 Difference]: Without dead ends: 5276 [2019-03-04 16:27:57,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5276 states. [2019-03-04 16:27:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5276 to 5234. [2019-03-04 16:27:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2019-03-04 16:27:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 36735 transitions. [2019-03-04 16:27:59,275 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 36735 transitions. Word has length 7 [2019-03-04 16:27:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:59,276 INFO L480 AbstractCegarLoop]: Abstraction has 5234 states and 36735 transitions. [2019-03-04 16:27:59,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 36735 transitions. [2019-03-04 16:27:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:59,283 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:59,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:59,284 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:59,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-03-04 16:27:59,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:59,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:59,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:59,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:59,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:59,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:59,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:59,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:59,380 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:27:59,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:59,413 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:59,413 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,423 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,434 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,450 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,473 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,502 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,538 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:27:59,541 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 24 treesize of output 26 [2019-03-04 16:27:59,545 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:27:59,548 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 28 treesize of output 30 [2019-03-04 16:27:59,552 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:27:59,556 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:27:59,556 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,568 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,580 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,591 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,603 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,615 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,659 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:59,660 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:27:59,701 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:59,702 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,744 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:59,745 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:27:59,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 43 treesize of output 41 [2019-03-04 16:27:59,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,824 INFO L309 ElimStorePlain]: Start of recursive call 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:59,824 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:27:59,884 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:59,885 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:59,909 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:59,909 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-03-04 16:27:59,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:27:59,990 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:00,014 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:28:00,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:47 [2019-03-04 16:28:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:00,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:00,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:28:00,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:28:00,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:28:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:28:00,062 INFO L87 Difference]: Start difference. First operand 5234 states and 36735 transitions. Second operand 11 states. [2019-03-04 16:28:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:02,853 INFO L93 Difference]: Finished difference Result 5480 states and 38165 transitions. [2019-03-04 16:28:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:28:02,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:28:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:02,876 INFO L225 Difference]: With dead ends: 5480 [2019-03-04 16:28:02,876 INFO L226 Difference]: Without dead ends: 5477 [2019-03-04 16:28:02,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:28:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2019-03-04 16:28:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5407. [2019-03-04 16:28:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5407 states. [2019-03-04 16:28:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5407 states to 5407 states and 37946 transitions. [2019-03-04 16:28:04,852 INFO L78 Accepts]: Start accepts. Automaton has 5407 states and 37946 transitions. Word has length 7 [2019-03-04 16:28:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:04,852 INFO L480 AbstractCegarLoop]: Abstraction has 5407 states and 37946 transitions. [2019-03-04 16:28:04,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:28:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5407 states and 37946 transitions. [2019-03-04 16:28:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:04,860 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:04,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:04,860 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2030625208, now seen corresponding path program 1 times [2019-03-04 16:28:04,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:04,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:04,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:04,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:04,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:05,139 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-03-04 16:28:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:05,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:05,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:05,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:05,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:05,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:05,236 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:28:05,237 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,244 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,265 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,287 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,313 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,342 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 21 treesize of output 24 [2019-03-04 16:28:05,346 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 24 treesize of output 26 [2019-03-04 16:28:05,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:28:05,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:05,354 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:28:05,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:28:05,396 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,406 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,417 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,429 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,440 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,451 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,484 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:05,484 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:28:05,570 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:05,571 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,629 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:05,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:28:05,674 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:28:05,675 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,700 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:05,700 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:28:05,757 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:28:05,757 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,775 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:05,776 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:28:05,845 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:28:05,846 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:05,864 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:05,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:38 [2019-03-04 16:28:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-03-04 16:28:05,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:28:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:28:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:28:05,912 INFO L87 Difference]: Start difference. First operand 5407 states and 37946 transitions. Second operand 13 states. [2019-03-04 16:28:06,174 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-03-04 16:28:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:09,082 INFO L93 Difference]: Finished difference Result 6522 states and 45470 transitions. [2019-03-04 16:28:09,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:28:09,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:28:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:09,106 INFO L225 Difference]: With dead ends: 6522 [2019-03-04 16:28:09,106 INFO L226 Difference]: Without dead ends: 6521 [2019-03-04 16:28:09,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:28:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6521 states. [2019-03-04 16:28:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6521 to 5650. [2019-03-04 16:28:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-03-04 16:28:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 39652 transitions. [2019-03-04 16:28:11,396 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 39652 transitions. Word has length 7 [2019-03-04 16:28:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:11,396 INFO L480 AbstractCegarLoop]: Abstraction has 5650 states and 39652 transitions. [2019-03-04 16:28:11,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:28:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 39652 transitions. [2019-03-04 16:28:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:11,405 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:11,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:11,405 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:11,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-03-04 16:28:11,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:11,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:28:11,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:11,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:11,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:11,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:11,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:11,561 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:28:11,562 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,569 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,579 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,589 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,608 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,630 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 21 treesize of output 24 [2019-03-04 16:28:11,633 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 24 treesize of output 26 [2019-03-04 16:28:11,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:28:11,640 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:11,643 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 30 treesize of output 32 [2019-03-04 16:28:11,681 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:28:11,682 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,694 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,705 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,717 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,727 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,738 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,769 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:11,770 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-03-04 16:28:11,836 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:11,837 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,864 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:11,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:28:11,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:28:11,905 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,923 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:11,923 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:28:11,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:28:11,973 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,988 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:11,988 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:28:12,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:28:12,050 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:12,066 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:12,066 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:28:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:12,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:12,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:28:12,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:28:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:28:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:28:12,111 INFO L87 Difference]: Start difference. First operand 5650 states and 39652 transitions. Second operand 12 states. [2019-03-04 16:28:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:14,824 INFO L93 Difference]: Finished difference Result 5724 states and 39960 transitions. [2019-03-04 16:28:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:28:14,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:28:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:14,845 INFO L225 Difference]: With dead ends: 5724 [2019-03-04 16:28:14,845 INFO L226 Difference]: Without dead ends: 5723 [2019-03-04 16:28:14,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:28:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2019-03-04 16:28:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5657. [2019-03-04 16:28:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5657 states. [2019-03-04 16:28:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 5657 states and 39701 transitions. [2019-03-04 16:28:17,707 INFO L78 Accepts]: Start accepts. Automaton has 5657 states and 39701 transitions. Word has length 7 [2019-03-04 16:28:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:17,708 INFO L480 AbstractCegarLoop]: Abstraction has 5657 states and 39701 transitions. [2019-03-04 16:28:17,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:28:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5657 states and 39701 transitions. [2019-03-04 16:28:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:17,715 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:17,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:17,716 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-03-04 16:28:17,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:17,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:17,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:17,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:28:17,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:17,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:17,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:17,806 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:28:17,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:17,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:28:17,854 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,863 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,870 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,888 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,915 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,948 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 21 treesize of output 24 [2019-03-04 16:28:17,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:28:17,969 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:28:17,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:17,981 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:28:17,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:28:17,987 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,998 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,009 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,021 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,032 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,044 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,084 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:18,084 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:28:18,118 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:28:18,119 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,158 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:18,158 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:28:18,211 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:28:18,212 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:18,265 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:18,265 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:110 [2019-03-04 16:28:18,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:28:18,327 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,347 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:18,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:38 [2019-03-04 16:28:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:18,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:18,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:18,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:18,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:18,389 INFO L87 Difference]: Start difference. First operand 5657 states and 39701 transitions. Second operand 10 states. [2019-03-04 16:28:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:21,087 INFO L93 Difference]: Finished difference Result 6057 states and 42211 transitions. [2019-03-04 16:28:21,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:28:21,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:28:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:21,108 INFO L225 Difference]: With dead ends: 6057 [2019-03-04 16:28:21,108 INFO L226 Difference]: Without dead ends: 6056 [2019-03-04 16:28:21,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:28:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-03-04 16:28:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5892. [2019-03-04 16:28:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5892 states. [2019-03-04 16:28:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 41346 transitions. [2019-03-04 16:28:23,530 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 41346 transitions. Word has length 7 [2019-03-04 16:28:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:23,531 INFO L480 AbstractCegarLoop]: Abstraction has 5892 states and 41346 transitions. [2019-03-04 16:28:23,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:28:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 41346 transitions. [2019-03-04 16:28:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:23,539 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:23,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:23,539 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-03-04 16:28:23,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:23,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:23,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:23,760 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 19 [2019-03-04 16:28:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:28:23,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:23,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:23,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:23,874 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:28:23,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:23,879 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 21 treesize of output 24 [2019-03-04 16:28:23,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,884 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 24 treesize of output 26 [2019-03-04 16:28:23,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,891 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 26 treesize of output 28 [2019-03-04 16:28:23,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,902 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 28 treesize of output 30 [2019-03-04 16:28:23,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,918 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:28:23,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:23,940 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:28:23,940 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:23,967 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:23,980 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:23,995 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,010 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,023 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,095 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:28:24,096 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,134 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,143 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,155 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,178 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,207 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,252 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:24,252 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:28:24,300 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:28:24,301 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,347 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:24,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:28:24,399 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:28:24,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,431 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:24,432 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:28:24,535 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:28:24,536 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,560 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:24,561 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:51 [2019-03-04 16:28:24,634 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 57 [2019-03-04 16:28:24,635 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:24,656 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:28:24,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-03-04 16:28:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:24,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:28:24,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:28:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:28:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:28:24,714 INFO L87 Difference]: Start difference. First operand 5892 states and 41346 transitions. Second operand 12 states. [2019-03-04 16:28:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:28,673 INFO L93 Difference]: Finished difference Result 7952 states and 55578 transitions. [2019-03-04 16:28:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:28:28,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:28:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:28,701 INFO L225 Difference]: With dead ends: 7952 [2019-03-04 16:28:28,701 INFO L226 Difference]: Without dead ends: 7951 [2019-03-04 16:28:28,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:28:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7951 states. [2019-03-04 16:28:31,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7951 to 7302. [2019-03-04 16:28:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-03-04 16:28:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 51369 transitions. [2019-03-04 16:28:31,695 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 51369 transitions. Word has length 7 [2019-03-04 16:28:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:31,695 INFO L480 AbstractCegarLoop]: Abstraction has 7302 states and 51369 transitions. [2019-03-04 16:28:31,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:28:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 51369 transitions. [2019-03-04 16:28:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:31,704 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:31,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:31,704 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-03-04 16:28:31,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:31,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:31,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:31,894 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-03-04 16:28:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:28:31,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:31,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:31,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:31,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:28:31,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:31,978 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 21 treesize of output 24 [2019-03-04 16:28:31,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:28:31,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:31,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:31,999 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:28:32,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:32,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:28:32,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:32,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:28:32,079 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,090 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,103 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,115 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,128 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,140 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:32,179 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,187 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,200 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,216 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,245 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:32,245 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-03-04 16:28:32,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:32,292 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,318 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:32,318 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 16:28:32,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:28:32,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:32,396 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:32,397 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:76 [2019-03-04 16:28:32,498 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 46 [2019-03-04 16:28:32,499 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,563 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:28:32,564 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:32,624 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:32,625 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:74 [2019-03-04 16:28:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:32,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:32,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-03-04 16:28:32,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:28:32,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:28:32,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:28:32,694 INFO L87 Difference]: Start difference. First operand 7302 states and 51369 transitions. Second operand 11 states. [2019-03-04 16:28:33,015 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-03-04 16:28:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:36,617 INFO L93 Difference]: Finished difference Result 7985 states and 55817 transitions. [2019-03-04 16:28:36,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:28:36,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:28:36,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:36,646 INFO L225 Difference]: With dead ends: 7985 [2019-03-04 16:28:36,646 INFO L226 Difference]: Without dead ends: 7984 [2019-03-04 16:28:36,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:28:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7984 states. [2019-03-04 16:28:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7984 to 7888. [2019-03-04 16:28:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-03-04 16:28:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 55482 transitions. [2019-03-04 16:28:40,193 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 55482 transitions. Word has length 7 [2019-03-04 16:28:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:40,193 INFO L480 AbstractCegarLoop]: Abstraction has 7888 states and 55482 transitions. [2019-03-04 16:28:40,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:28:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 55482 transitions. [2019-03-04 16:28:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:40,201 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:40,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:40,202 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2015771928, now seen corresponding path program 1 times [2019-03-04 16:28:40,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:40,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:40,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:40,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:40,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:40,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:40,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:28:40,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:40,340 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 21 treesize of output 24 [2019-03-04 16:28:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:28:40,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,467 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:28:40,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,631 INFO L301 Elim1Store]: Index analysis took 140 ms [2019-03-04 16:28:40,645 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:40,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,902 INFO L301 Elim1Store]: Index analysis took 229 ms [2019-03-04 16:28:40,918 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:28:40,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:40,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:41,092 INFO L301 Elim1Store]: Index analysis took 149 ms [2019-03-04 16:28:41,094 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:28:41,094 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,108 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,121 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,134 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,147 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,159 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:28:41,211 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,215 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,227 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,246 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,273 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,315 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:41,315 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:28:41,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:41,372 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,399 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:41,400 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:28:41,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, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:28:41,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,458 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:41,458 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:28:41,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:28:41,510 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:41,526 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:41,527 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:28:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:41,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:41,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:41,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:41,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:41,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:41,569 INFO L87 Difference]: Start difference. First operand 7888 states and 55482 transitions. Second operand 10 states. [2019-03-04 16:28:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:45,318 INFO L93 Difference]: Finished difference Result 7927 states and 55521 transitions. [2019-03-04 16:28:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:28:45,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:28:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:45,345 INFO L225 Difference]: With dead ends: 7927 [2019-03-04 16:28:45,345 INFO L226 Difference]: Without dead ends: 7926 [2019-03-04 16:28:45,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:28:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2019-03-04 16:28:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 7888. [2019-03-04 16:28:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-03-04 16:28:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 55482 transitions. [2019-03-04 16:28:48,765 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 55482 transitions. Word has length 7 [2019-03-04 16:28:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:48,766 INFO L480 AbstractCegarLoop]: Abstraction has 7888 states and 55482 transitions. [2019-03-04 16:28:48,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:28:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 55482 transitions. [2019-03-04 16:28:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:48,774 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:48,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:48,774 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-03-04 16:28:48,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:48,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:48,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:49,055 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-03-04 16:28:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:49,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:49,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:49,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:49,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:28:49,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:49,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:28:49,287 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,295 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,308 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,325 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,351 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,383 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:28:49,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, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:28:49,401 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:28:49,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:49,412 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:28:49,418 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:28:49,418 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,430 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,441 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,453 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,465 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,477 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:49,519 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-03-04 16:28:49,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:49,591 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,619 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:49,620 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:28:49,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:28:49,665 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,683 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:49,684 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:28:49,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, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:28:49,741 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,757 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:49,757 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 16:28:49,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 48 [2019-03-04 16:28:49,820 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:49,833 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:49,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:28:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:49,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:49,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-03-04 16:28:49,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:28:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:28:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:28:49,884 INFO L87 Difference]: Start difference. First operand 7888 states and 55482 transitions. Second operand 13 states. [2019-03-04 16:28:50,791 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-03-04 16:28:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:55,323 INFO L93 Difference]: Finished difference Result 8861 states and 61788 transitions. [2019-03-04 16:28:55,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:28:55,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:28:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:55,356 INFO L225 Difference]: With dead ends: 8861 [2019-03-04 16:28:55,357 INFO L226 Difference]: Without dead ends: 8852 [2019-03-04 16:28:55,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:28:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2019-03-04 16:28:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 8125. [2019-03-04 16:28:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8125 states. [2019-03-04 16:28:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8125 states to 8125 states and 57176 transitions. [2019-03-04 16:28:58,991 INFO L78 Accepts]: Start accepts. Automaton has 8125 states and 57176 transitions. Word has length 7 [2019-03-04 16:28:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:58,991 INFO L480 AbstractCegarLoop]: Abstraction has 8125 states and 57176 transitions. [2019-03-04 16:28:58,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:28:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 8125 states and 57176 transitions. [2019-03-04 16:28:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:28:58,999 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:58,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:59,000 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-03-04 16:28:59,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:59,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:59,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:59,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:59,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:28:59,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:59,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:28:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:59,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:28:59,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:28:59,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:28:59,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:28:59,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:59,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:28:59,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:59,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:28:59,230 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,243 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,257 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,270 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,282 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,295 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:28:59,344 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,350 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,358 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,376 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,401 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,441 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:59,441 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:28:59,475 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:28:59,475 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:59,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:28:59,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, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:28:59,559 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:59,588 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:59,589 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:59 [2019-03-04 16:28:59,834 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 4 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:28:59,835 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:59,892 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:28:59,892 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:118 [2019-03-04 16:28:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:59,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:59,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:59,968 INFO L87 Difference]: Start difference. First operand 8125 states and 57176 transitions. Second operand 10 states. [2019-03-04 16:29:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:04,155 INFO L93 Difference]: Finished difference Result 8154 states and 57209 transitions. [2019-03-04 16:29:04,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:29:04,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:29:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:04,185 INFO L225 Difference]: With dead ends: 8154 [2019-03-04 16:29:04,185 INFO L226 Difference]: Without dead ends: 8153 [2019-03-04 16:29:04,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:29:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8153 states. [2019-03-04 16:29:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8153 to 8122. [2019-03-04 16:29:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8122 states. [2019-03-04 16:29:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 57155 transitions. [2019-03-04 16:29:07,812 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 57155 transitions. Word has length 7 [2019-03-04 16:29:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:07,812 INFO L480 AbstractCegarLoop]: Abstraction has 8122 states and 57155 transitions. [2019-03-04 16:29:07,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:29:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 57155 transitions. [2019-03-04 16:29:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:29:07,820 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:07,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:07,820 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-03-04 16:29:07,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:07,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:07,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:07,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:07,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:07,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:29:07,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:07,945 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:29:07,945 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:07,952 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:07,963 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:07,979 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:29:08,014 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:29:08,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:29:08,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:29:08,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:29:08,066 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:29:08,067 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,076 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,088 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,099 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,110 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,121 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,151 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:08,151 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-03-04 16:29:08,200 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:29:08,201 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,216 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:08,217 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:29:08,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:29:08,250 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,262 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:08,263 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-03-04 16:29:08,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-03-04 16:29:08,303 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:08,314 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:29:08,359 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 47 [2019-03-04 16:29:08,360 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:08,371 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:08,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:29:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:08,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:08,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:29:08,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:29:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:29:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:29:08,410 INFO L87 Difference]: Start difference. First operand 8122 states and 57155 transitions. Second operand 12 states. [2019-03-04 16:29:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:12,625 INFO L93 Difference]: Finished difference Result 8434 states and 58984 transitions. [2019-03-04 16:29:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:29:12,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:29:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:12,652 INFO L225 Difference]: With dead ends: 8434 [2019-03-04 16:29:12,652 INFO L226 Difference]: Without dead ends: 8433 [2019-03-04 16:29:12,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:29:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8433 states. [2019-03-04 16:29:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8433 to 7839. [2019-03-04 16:29:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7839 states. [2019-03-04 16:29:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7839 states to 7839 states and 55193 transitions. [2019-03-04 16:29:16,032 INFO L78 Accepts]: Start accepts. Automaton has 7839 states and 55193 transitions. Word has length 7 [2019-03-04 16:29:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:16,032 INFO L480 AbstractCegarLoop]: Abstraction has 7839 states and 55193 transitions. [2019-03-04 16:29:16,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:29:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7839 states and 55193 transitions. [2019-03-04 16:29:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:29:16,040 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:16,040 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:29:16,040 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-03-04 16:29:16,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:16,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:16,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:16,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:16,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:29:16,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:16,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:16,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:29:16,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:29:16,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:16,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:29:16,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:16,320 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 21 treesize of output 24 [2019-03-04 16:29:16,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,324 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 24 treesize of output 26 [2019-03-04 16:29:16,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,332 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 26 treesize of output 28 [2019-03-04 16:29:16,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:29:16,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,360 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 30 treesize of output 32 [2019-03-04 16:29:16,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:16,382 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:29:16,383 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,396 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,409 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,423 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,436 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,450 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,509 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:29:16,509 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,519 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,524 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,538 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,555 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,583 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,629 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:16,630 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:29:16,666 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:29:16,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,709 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:16,709 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:29:16,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, 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:29:16,753 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,784 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:16,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:29:16,836 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:29:16,837 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:16,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-03-04 16:29:16,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, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 55 [2019-03-04 16:29:16,931 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:16,953 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:16,953 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:47 [2019-03-04 16:29:17,041 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 60 [2019-03-04 16:29:17,042 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29: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:29:17,062 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:43 [2019-03-04 16:29:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:17,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:17,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:29:17,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:29:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:29:17,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:29:17,108 INFO L87 Difference]: Start difference. First operand 7839 states and 55193 transitions. Second operand 13 states. [2019-03-04 16:29:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:22,022 INFO L93 Difference]: Finished difference Result 9637 states and 67326 transitions. [2019-03-04 16:29:22,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:29:22,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:29:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:22,059 INFO L225 Difference]: With dead ends: 9637 [2019-03-04 16:29:22,059 INFO L226 Difference]: Without dead ends: 9633 [2019-03-04 16:29:22,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:29:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9633 states. [2019-03-04 16:29:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9633 to 8414. [2019-03-04 16:29:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8414 states. [2019-03-04 16:29:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8414 states to 8414 states and 59194 transitions. [2019-03-04 16:29:26,336 INFO L78 Accepts]: Start accepts. Automaton has 8414 states and 59194 transitions. Word has length 7 [2019-03-04 16:29:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:26,336 INFO L480 AbstractCegarLoop]: Abstraction has 8414 states and 59194 transitions. [2019-03-04 16:29:26,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:29:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8414 states and 59194 transitions. [2019-03-04 16:29:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:29:26,344 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:26,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:26,345 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-03-04 16:29:26,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:26,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:26,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:26,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:26,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:26,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:26,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:26,427 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:29:26,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:26,432 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 21 treesize of output 24 [2019-03-04 16:29:26,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:29:26,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:29:26,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,480 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:29:26,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:29:26,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:26,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:29:26,521 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,533 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,546 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,560 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,573 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,585 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,635 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:29:26,636 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,642 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,654 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,670 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,696 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,739 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:26,739 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:29:26,770 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:29:26,771 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,811 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:26,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:29:26,852 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:29:26,852 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,880 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:26,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-03-04 16:29:26,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:29:26,932 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,954 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:29:26,955 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:47 [2019-03-04 16:29:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:26,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:26,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:29:26,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:29:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:29:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:29:26,997 INFO L87 Difference]: Start difference. First operand 8414 states and 59194 transitions. Second operand 10 states. [2019-03-04 16:29:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:31,576 INFO L93 Difference]: Finished difference Result 8698 states and 60900 transitions. [2019-03-04 16:29:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:29:31,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:29:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:31,609 INFO L225 Difference]: With dead ends: 8698 [2019-03-04 16:29:31,609 INFO L226 Difference]: Without dead ends: 8697 [2019-03-04 16:29:31,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:29:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8697 states. [2019-03-04 16:29:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8697 to 8639. [2019-03-04 16:29:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8639 states. [2019-03-04 16:29:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8639 states to 8639 states and 60795 transitions. [2019-03-04 16:29:36,504 INFO L78 Accepts]: Start accepts. Automaton has 8639 states and 60795 transitions. Word has length 7 [2019-03-04 16:29:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:36,504 INFO L480 AbstractCegarLoop]: Abstraction has 8639 states and 60795 transitions. [2019-03-04 16:29:36,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:29:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8639 states and 60795 transitions. [2019-03-04 16:29:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:29:36,513 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:36,514 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:29:36,514 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-03-04 16:29:36,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:36,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:36,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:36,601 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:29:36,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:36,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:36,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:36,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:29:36,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:36,622 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 21 treesize of output 24 [2019-03-04 16:29:36,639 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:29:36,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,648 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:29:36,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:29:36,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:29:36,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:36,726 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:29:36,727 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,740 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,752 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,765 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,777 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,790 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:29:36,828 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,833 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,842 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,857 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:36,885 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:29:36,885 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:29:36,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:29:36,922 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:29:36,969 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:36,969 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:29:37,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:29:37,014 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,028 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:37,029 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2019-03-04 16:29:37,043 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:29:37,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:37,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:29:37,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:29:37,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:29:37,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:29:37,063 INFO L87 Difference]: Start difference. First operand 8639 states and 60795 transitions. Second operand 7 states. [2019-03-04 16:29:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:41,292 INFO L93 Difference]: Finished difference Result 8655 states and 60816 transitions. [2019-03-04 16:29:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:29:41,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:29:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:41,324 INFO L225 Difference]: With dead ends: 8655 [2019-03-04 16:29:41,324 INFO L226 Difference]: Without dead ends: 8654 [2019-03-04 16:29:41,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:29:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2019-03-04 16:29:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 8639. [2019-03-04 16:29:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8639 states. [2019-03-04 16:29:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8639 states to 8639 states and 60795 transitions. [2019-03-04 16:29:45,716 INFO L78 Accepts]: Start accepts. Automaton has 8639 states and 60795 transitions. Word has length 7 [2019-03-04 16:29:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:45,716 INFO L480 AbstractCegarLoop]: Abstraction has 8639 states and 60795 transitions. [2019-03-04 16:29:45,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:29:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8639 states and 60795 transitions. [2019-03-04 16:29:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:29:45,725 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:45,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:45,726 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:45,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:45,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-03-04 16:29:45,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:45,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:45,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:45,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:45,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:29:45,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:45,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:45,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:45,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:29:45,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:45,835 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 21 treesize of output 24 [2019-03-04 16:29:45,857 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:29:45,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,867 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:29:45,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:29:45,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,896 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:29:45,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:45,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:29:45,918 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:45,931 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:45,943 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:45,956 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:45,968 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:45,981 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:29:46,030 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,037 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,049 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,068 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,093 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,134 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:46,135 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:29:46,176 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 41 treesize of output 43 [2019-03-04 16:29:46,177 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:29:46,240 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:46,240 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-03-04 16:29:46,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:29:46,297 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:46,323 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-03-04 16:29:46,370 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 37 [2019-03-04 16:29:46,371 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:46,387 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:46,387 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:36 [2019-03-04 16:29:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:46,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:46,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:29:46,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:29:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:29:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:29:46,426 INFO L87 Difference]: Start difference. First operand 8639 states and 60795 transitions. Second operand 10 states. [2019-03-04 16:29:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:51,395 INFO L93 Difference]: Finished difference Result 8774 states and 61469 transitions. [2019-03-04 16:29:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:29:51,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:29:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:51,431 INFO L225 Difference]: With dead ends: 8774 [2019-03-04 16:29:51,432 INFO L226 Difference]: Without dead ends: 8773 [2019-03-04 16:29:51,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:29:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-03-04 16:29:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 8699. [2019-03-04 16:29:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8699 states. [2019-03-04 16:29:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8699 states to 8699 states and 61215 transitions. [2019-03-04 16:29:55,872 INFO L78 Accepts]: Start accepts. Automaton has 8699 states and 61215 transitions. Word has length 7 [2019-03-04 16:29:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:55,872 INFO L480 AbstractCegarLoop]: Abstraction has 8699 states and 61215 transitions. [2019-03-04 16:29:55,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:29:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 8699 states and 61215 transitions. [2019-03-04 16:29:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:29:55,886 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:55,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:55,886 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-03-04 16:29:55,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:55,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:55,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:29:55,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:55,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:29:56,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:56,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:29:56,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:56,055 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:29:56,056 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,067 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,082 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,099 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,124 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,157 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,197 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 21 treesize of output 24 [2019-03-04 16:29:56,201 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 24 treesize of output 26 [2019-03-04 16:29:56,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:29:56,214 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 28 treesize of output 30 [2019-03-04 16:29:56,218 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 30 treesize of output 32 [2019-03-04 16:29:56,221 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:29:56,222 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,234 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,246 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,257 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,269 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,281 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,324 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:56,325 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:29:56,366 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:29:56,366 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,407 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:56,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:29:56,459 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:29:56,460 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,492 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:56,492 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-03-04 16:29:56,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, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 41 treesize of output 50 [2019-03-04 16:29:56,560 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,588 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:56,588 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:49 [2019-03-04 16:29:56,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:29:56,667 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:56,690 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:29:56,691 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-03-04 16:29:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:56,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:56,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:29:56,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:29:56,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:29:56,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:29:56,741 INFO L87 Difference]: Start difference. First operand 8699 states and 61215 transitions. Second operand 12 states. [2019-03-04 16:30:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:02,030 INFO L93 Difference]: Finished difference Result 8953 states and 62692 transitions. [2019-03-04 16:30:02,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:30:02,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:30:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:02,062 INFO L225 Difference]: With dead ends: 8953 [2019-03-04 16:30:02,062 INFO L226 Difference]: Without dead ends: 8952 [2019-03-04 16:30:02,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:30:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8952 states. [2019-03-04 16:30:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8952 to 8901. [2019-03-04 16:30:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8901 states. [2019-03-04 16:30:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8901 states to 8901 states and 62629 transitions. [2019-03-04 16:30:06,837 INFO L78 Accepts]: Start accepts. Automaton has 8901 states and 62629 transitions. Word has length 7 [2019-03-04 16:30:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:06,837 INFO L480 AbstractCegarLoop]: Abstraction has 8901 states and 62629 transitions. [2019-03-04 16:30:06,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:30:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8901 states and 62629 transitions. [2019-03-04 16:30:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:30:06,847 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:06,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:06,847 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-03-04 16:30:06,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:06,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:06,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:06,917 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:30:06,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:06,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:06,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:06,932 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:30:06,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:06,941 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 21 treesize of output 24 [2019-03-04 16:30:06,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:30:06,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:30:06,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:30:06,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:06,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,007 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:30:07,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:07,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:30:07,032 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,045 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,058 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,072 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,085 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,098 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:30:07,145 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,151 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,164 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,186 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,213 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,257 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:30:07,257 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:30:07,291 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 41 treesize of output 43 [2019-03-04 16:30:07,291 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:30:07,351 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:30:07,352 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-03-04 16:30:07,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:30:07,396 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,423 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:07,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-03-04 16:30:07,443 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:30:07,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:07,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:30:07,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:30:07,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:30:07,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:30:07,462 INFO L87 Difference]: Start difference. First operand 8901 states and 62629 transitions. Second operand 8 states. [2019-03-04 16:30:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:12,643 INFO L93 Difference]: Finished difference Result 8924 states and 62652 transitions. [2019-03-04 16:30:12,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:30:12,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:30:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:12,674 INFO L225 Difference]: With dead ends: 8924 [2019-03-04 16:30:12,674 INFO L226 Difference]: Without dead ends: 8923 [2019-03-04 16:30:12,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:30:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8923 states. [2019-03-04 16:30:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8923 to 8900. [2019-03-04 16:30:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8900 states. [2019-03-04 16:30:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8900 states to 8900 states and 62622 transitions. [2019-03-04 16:30:17,252 INFO L78 Accepts]: Start accepts. Automaton has 8900 states and 62622 transitions. Word has length 7 [2019-03-04 16:30:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:17,252 INFO L480 AbstractCegarLoop]: Abstraction has 8900 states and 62622 transitions. [2019-03-04 16:30:17,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:30:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8900 states and 62622 transitions. [2019-03-04 16:30:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:30:17,262 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:17,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:17,262 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1935330284, now seen corresponding path program 1 times [2019-03-04 16:30:17,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:17,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:30:17,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:17,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:17,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:17,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:30:17,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:17,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:30:17,413 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,419 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,429 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,446 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,471 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,500 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 21 treesize of output 24 [2019-03-04 16:30:17,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:30:17,506 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:30:17,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:30:17,512 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:30:17,549 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:30:17,550 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,560 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,571 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,583 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,594 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,605 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,636 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:17,636 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:30:17,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:30:17,689 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:17,717 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:30:17,756 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:30:17,756 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,777 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:17,778 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:30:17,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:30:17,830 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,849 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:30:17,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:30:17,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, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 44 [2019-03-04 16:30:17,909 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:17,924 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:30:17,925 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:40 [2019-03-04 16:30:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:17,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:17,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:30:17,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:30:17,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:30:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:30:17,959 INFO L87 Difference]: Start difference. First operand 8900 states and 62622 transitions. Second operand 11 states. [2019-03-04 16:30:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:23,172 INFO L93 Difference]: Finished difference Result 9279 states and 65013 transitions. [2019-03-04 16:30:23,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:30:23,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:30:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:23,205 INFO L225 Difference]: With dead ends: 9279 [2019-03-04 16:30:23,205 INFO L226 Difference]: Without dead ends: 9278 [2019-03-04 16:30:23,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:30:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9278 states. [2019-03-04 16:30:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9278 to 8920. [2019-03-04 16:30:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8920 states. [2019-03-04 16:30:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8920 states to 8920 states and 62762 transitions. [2019-03-04 16:30:27,899 INFO L78 Accepts]: Start accepts. Automaton has 8920 states and 62762 transitions. Word has length 7 [2019-03-04 16:30:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:27,899 INFO L480 AbstractCegarLoop]: Abstraction has 8920 states and 62762 transitions. [2019-03-04 16:30:27,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:30:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8920 states and 62762 transitions. [2019-03-04 16:30:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:30:27,911 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:27,911 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:30:27,912 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 6 times [2019-03-04 16:30:27,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:30:27,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:27,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:30:28,010 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-03-04 16:30:28,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:28,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:30:28,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:28,058 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:30:28,059 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,065 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,073 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,085 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,108 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,143 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,185 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 21 treesize of output 24 [2019-03-04 16:30:28,188 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 24 treesize of output 26 [2019-03-04 16:30:28,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:30:28,195 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 28 treesize of output 30 [2019-03-04 16:30:28,199 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:30:28,203 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:30:28,203 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,213 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,225 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,237 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,248 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,259 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:28,304 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:30:28,343 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:30:28,344 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,386 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:28,386 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:30:28,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, 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:30:28,430 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,463 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:28,463 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:30:28,519 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:30:28,519 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,546 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:28,546 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:51 [2019-03-04 16:30:28,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 45 treesize of output 60 [2019-03-04 16:30:28,626 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,648 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:28,649 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:47 [2019-03-04 16:30:28,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 18 case distinctions, treesize of input 45 treesize of output 57 [2019-03-04 16:30:28,717 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:28,736 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:30:28,736 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:45 [2019-03-04 16:30:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:28,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:28,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:30:28,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:30:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:30:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:30:28,779 INFO L87 Difference]: Start difference. First operand 8920 states and 62762 transitions. Second operand 13 states. [2019-03-04 16:30:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:35,100 INFO L93 Difference]: Finished difference Result 9904 states and 69342 transitions. [2019-03-04 16:30:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:30:35,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:30:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:35,136 INFO L225 Difference]: With dead ends: 9904 [2019-03-04 16:30:35,136 INFO L226 Difference]: Without dead ends: 9902 [2019-03-04 16:30:35,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:30:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2019-03-04 16:30:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 5123. [2019-03-04 16:30:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5123 states. [2019-03-04 16:30:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5123 states to 5123 states and 36159 transitions. [2019-03-04 16:30:38,522 INFO L78 Accepts]: Start accepts. Automaton has 5123 states and 36159 transitions. Word has length 7 [2019-03-04 16:30:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:38,522 INFO L480 AbstractCegarLoop]: Abstraction has 5123 states and 36159 transitions. [2019-03-04 16:30:38,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:30:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5123 states and 36159 transitions. [2019-03-04 16:30:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:30:38,528 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:38,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:38,529 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:38,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:38,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1937415654, now seen corresponding path program 1 times [2019-03-04 16:30:38,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:38,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:38,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:38,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:38,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:30:38,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:38,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:30:38,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:38,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:30:38,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:38,668 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 21 treesize of output 24 [2019-03-04 16:30:38,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,673 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 24 treesize of output 26 [2019-03-04 16:30:38,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,683 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 26 treesize of output 28 [2019-03-04 16:30:38,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:30:38,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,708 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 30 treesize of output 32 [2019-03-04 16:30:38,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:38,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:30:38,759 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,770 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,783 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,796 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,808 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,821 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:30:38,866 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,871 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,884 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,896 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,914 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:38,945 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:38,945 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-03-04 16:30:39,044 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:30:39,044 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:30:39,094 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:39,094 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-03-04 16:30:39,249 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 65 treesize of output 95 [2019-03-04 16:30:39,253 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:30:39,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 83 [2019-03-04 16:30:39,544 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:39,796 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-03-04 16:30:39,796 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:284 [2019-03-04 16:30:40,008 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-03-04 16:30:40,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2019-03-04 16:30:40,019 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:40,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:30:40,174 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:40,298 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:30:40,299 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:40,420 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:30:40,421 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:40,501 INFO L309 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-03-04 16:30:40,501 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-03-04 16:30:48,673 WARN L181 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-03-04 16:30:48,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 58 [2019-03-04 16:30:48,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,807 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 62 [2019-03-04 16:30:48,808 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 46 treesize of output 61 [2019-03-04 16:30:48,936 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,988 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2019-03-04 16:30:48,989 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 15 variables, input treesize:153, output treesize:115 [2019-03-04 16:30:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:49,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:49,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:30:49,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:30:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:30:49,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:30:49,076 INFO L87 Difference]: Start difference. First operand 5123 states and 36159 transitions. Second operand 12 states. [2019-03-04 16:30:49,287 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-03-04 16:30:49,581 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-03-04 16:30:49,777 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-03-04 16:30:50,298 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-03-04 16:30:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:56,052 INFO L93 Difference]: Finished difference Result 8073 states and 56698 transitions. [2019-03-04 16:30:56,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:30:56,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:30:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:56,079 INFO L225 Difference]: With dead ends: 8073 [2019-03-04 16:30:56,079 INFO L226 Difference]: Without dead ends: 8067 [2019-03-04 16:30:56,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:30:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-03-04 16:31:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 6524. [2019-03-04 16:31:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6524 states. [2019-03-04 16:31:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6524 states to 6524 states and 46084 transitions. [2019-03-04 16:31:01,013 INFO L78 Accepts]: Start accepts. Automaton has 6524 states and 46084 transitions. Word has length 7 [2019-03-04 16:31:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:01,013 INFO L480 AbstractCegarLoop]: Abstraction has 6524 states and 46084 transitions. [2019-03-04 16:31:01,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:31:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 6524 states and 46084 transitions. [2019-03-04 16:31:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:31:01,020 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:01,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:31:01,020 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:01,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:01,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-03-04 16:31:01,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:01,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:01,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:31:01,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:01,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:31:01,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:01,129 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:31:01,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:01,172 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:31:01,172 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,182 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,195 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,216 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,243 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,275 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 21 treesize of output 24 [2019-03-04 16:31:01,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:31:01,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:31:01,301 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:31:01,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:31:01,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:31:01,310 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,322 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,333 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,345 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,357 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,368 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,409 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:01,409 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:31:01,453 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 41 treesize of output 43 [2019-03-04 16:31:01,454 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:31:01,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:01,520 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-03-04 16:31:01,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 70 [2019-03-04 16:31:01,632 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,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, 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:31:01,714 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,765 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:01,765 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:98 [2019-03-04 16:31:01,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:31:01,859 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,946 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:31:01,947 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:01,995 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:01,995 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:104 [2019-03-04 16:31:02,136 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-03-04 16:31:02,141 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:31:02,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:02,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:31:02,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:31:02,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:31:02,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:31:02,160 INFO L87 Difference]: Start difference. First operand 6524 states and 46084 transitions. Second operand 10 states. [2019-03-04 16:31:02,354 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-03-04 16:31:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:07,704 INFO L93 Difference]: Finished difference Result 6652 states and 46718 transitions. [2019-03-04 16:31:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:31:07,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:31:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:07,726 INFO L225 Difference]: With dead ends: 6652 [2019-03-04 16:31:07,726 INFO L226 Difference]: Without dead ends: 6651 [2019-03-04 16:31:07,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:31:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6651 states. [2019-03-04 16:31:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6651 to 6562. [2019-03-04 16:31:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6562 states. [2019-03-04 16:31:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 46350 transitions. [2019-03-04 16:31:12,814 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 46350 transitions. Word has length 7 [2019-03-04 16:31:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:12,814 INFO L480 AbstractCegarLoop]: Abstraction has 6562 states and 46350 transitions. [2019-03-04 16:31:12,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:31:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 46350 transitions. [2019-03-04 16:31:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:31:12,825 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:12,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:31:12,825 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-03-04 16:31:12,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:12,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:12,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:31:12,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:12,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:31:13,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:31:13,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:31:13,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:13,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:31:13,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:13,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:31:13,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,015 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 24 treesize of output 26 [2019-03-04 16:31:13,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,024 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:31:13,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,038 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:31:13,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,052 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 30 treesize of output 32 [2019-03-04 16:31:13,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:13,074 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:31:13,075 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,088 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,101 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,114 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,127 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,140 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,195 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:31:13,196 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,204 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,220 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,237 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,260 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,288 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,332 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:13,332 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:31:13,368 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:31:13,368 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,411 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:13,411 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:31:13,453 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:31:13,453 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,484 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:13,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-03-04 16:31:13,535 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:31:13,536 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,558 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:13,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-03-04 16:31:13,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 59 [2019-03-04 16:31:13,632 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:13,654 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:31:13,654 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-03-04 16:31:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:13,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:13,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:31:13,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:31:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:31:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:31:13,696 INFO L87 Difference]: Start difference. First operand 6562 states and 46350 transitions. Second operand 11 states. [2019-03-04 16:31:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:23,313 INFO L93 Difference]: Finished difference Result 9689 states and 68135 transitions. [2019-03-04 16:31:23,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:31:23,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:31:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:23,349 INFO L225 Difference]: With dead ends: 9689 [2019-03-04 16:31:23,349 INFO L226 Difference]: Without dead ends: 9688 [2019-03-04 16:31:23,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:31:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2019-03-04 16:31:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 8499. [2019-03-04 16:31:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8499 states. [2019-03-04 16:31:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8499 states to 8499 states and 60239 transitions. [2019-03-04 16:31:31,010 INFO L78 Accepts]: Start accepts. Automaton has 8499 states and 60239 transitions. Word has length 7 [2019-03-04 16:31:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:31,011 INFO L480 AbstractCegarLoop]: Abstraction has 8499 states and 60239 transitions. [2019-03-04 16:31:31,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:31:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8499 states and 60239 transitions. [2019-03-04 16:31:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:31:31,018 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:31,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:31:31,019 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1924684454, now seen corresponding path program 1 times [2019-03-04 16:31:31,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:31,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:31,126 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:31:31,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:31,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:31:31,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:31,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:31:31,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:31,144 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 21 treesize of output 24 [2019-03-04 16:31:31,161 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:31:31,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:31:31,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,183 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:31:31,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,199 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:31:31,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:31,285 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:31:31,286 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,299 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,311 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,324 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,336 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,349 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,386 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:31:31,386 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,392 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,402 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,417 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,447 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:31,448 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:31:31,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:31:31,491 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:31:31,535 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:31,535 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:31:31,614 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2019-03-04 16:31:31,615 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2019-03-04 16:31:31,679 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:31,724 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:31,724 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-03-04 16:31:31,787 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:31:31,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:31,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-03-04 16:31:31,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:31:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:31:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:31:31,806 INFO L87 Difference]: Start difference. First operand 8499 states and 60239 transitions. Second operand 9 states. [2019-03-04 16:31:32,000 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-03-04 16:31:32,151 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-03-04 16:31:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:39,544 INFO L93 Difference]: Finished difference Result 8568 states and 60479 transitions. [2019-03-04 16:31:39,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:31:39,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:31:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:39,575 INFO L225 Difference]: With dead ends: 8568 [2019-03-04 16:31:39,575 INFO L226 Difference]: Without dead ends: 8567 [2019-03-04 16:31:39,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:31:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2019-03-04 16:31:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 8518. [2019-03-04 16:31:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-03-04 16:31:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 60372 transitions. [2019-03-04 16:31:47,326 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 60372 transitions. Word has length 7 [2019-03-04 16:31:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:47,327 INFO L480 AbstractCegarLoop]: Abstraction has 8518 states and 60372 transitions. [2019-03-04 16:31:47,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:31:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 60372 transitions. [2019-03-04 16:31:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:31:47,335 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:47,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:31:47,335 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-03-04 16:31:47,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:47,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:47,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:31:47,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:47,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:31:47,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:47,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:31:47,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:47,461 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 21 treesize of output 24 [2019-03-04 16:31:47,477 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:31:47,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:31:47,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,501 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:31:47,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:31:47,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:47,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:31:47,542 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,556 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,569 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,583 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,598 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,612 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:31:47,666 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,671 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,686 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,708 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,736 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,781 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:31:47,782 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:31:47,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:31:47,829 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:31:47,897 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:31:47,898 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-03-04 16:31:47,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:31:47,947 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:47,975 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:47,976 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-03-04 16:31:48,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:31:48,132 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:48,152 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:31:48,152 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:36 [2019-03-04 16:31:48,174 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:31:48,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:48,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:31:48,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:31:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:31:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:31:48,193 INFO L87 Difference]: Start difference. First operand 8518 states and 60372 transitions. Second operand 10 states. [2019-03-04 16:31:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:56,777 INFO L93 Difference]: Finished difference Result 8732 states and 61528 transitions. [2019-03-04 16:31:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:31:56,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:31:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:56,809 INFO L225 Difference]: With dead ends: 8732 [2019-03-04 16:31:56,810 INFO L226 Difference]: Without dead ends: 8729 [2019-03-04 16:31:56,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:31:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8729 states. [2019-03-04 16:32:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8729 to 8591. [2019-03-04 16:32:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8591 states. [2019-03-04 16:32:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 60883 transitions. [2019-03-04 16:32:05,789 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 60883 transitions. Word has length 7 [2019-03-04 16:32:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:05,790 INFO L480 AbstractCegarLoop]: Abstraction has 8591 states and 60883 transitions. [2019-03-04 16:32:05,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:32:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 60883 transitions. [2019-03-04 16:32:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:32:05,797 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:05,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:32:05,798 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:32:05,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:05,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-03-04 16:32:05,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:05,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:05,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:05,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:32:05,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:05,976 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-03-04 16:32:06,001 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:32:06,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:06,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:32:06,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:32:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:06,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:32:06,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:06,018 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 21 treesize of output 24 [2019-03-04 16:32:06,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:32:06,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:32:06,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:32:06,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:32:06,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:06,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:32:06,119 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,131 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,154 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,165 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,178 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,190 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:32:06,228 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,236 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,245 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,261 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,292 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:32:06,292 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:32:06,342 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:32:06,343 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:32:06,386 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:32:06,387 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:32:06,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:32:06,424 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:06,441 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:32:06,441 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-03-04 16:32:06,461 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:32:06,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:06,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:32:06,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:32:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:32:06,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:32:06,479 INFO L87 Difference]: Start difference. First operand 8591 states and 60883 transitions. Second operand 8 states. [2019-03-04 16:32:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:14,403 INFO L93 Difference]: Finished difference Result 8612 states and 60903 transitions. [2019-03-04 16:32:14,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:32:14,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:32:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:14,435 INFO L225 Difference]: With dead ends: 8612 [2019-03-04 16:32:14,435 INFO L226 Difference]: Without dead ends: 8611 [2019-03-04 16:32:14,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:32:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2019-03-04 16:32:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 8591. [2019-03-04 16:32:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8591 states. [2019-03-04 16:32:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 60883 transitions. [2019-03-04 16:32:22,988 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 60883 transitions. Word has length 7 [2019-03-04 16:32:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:22,988 INFO L480 AbstractCegarLoop]: Abstraction has 8591 states and 60883 transitions. [2019-03-04 16:32:22,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:32:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 60883 transitions. [2019-03-04 16:32:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:32:22,996 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:22,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:32:22,996 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:32:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1905490114, now seen corresponding path program 1 times [2019-03-04 16:32:22,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:22,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:22,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:32:22,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:23,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:23,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:32:23,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:32:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:23,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:32:23,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:23,210 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 21 treesize of output 24 [2019-03-04 16:32:23,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:32:23,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,224 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 26 treesize of output 28 [2019-03-04 16:32:23,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:32:23,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,251 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 30 treesize of output 32 [2019-03-04 16:32:23,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:23,302 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:32:23,302 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,313 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,324 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,338 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,351 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,364 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:32:23,408 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,413 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,420 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,435 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,452 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,485 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:32:23,485 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-03-04 16:32:23,550 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:32:23,551 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:32:23,603 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:32:23,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:106 [2019-03-04 16:32:23,687 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2019-03-04 16:32:23,688 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:23,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, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 65 treesize of output 74 [2019-03-04 16:32:23,779 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:32:23,873 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-03-04 16:32:23,873 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:126 [2019-03-04 16:32:23,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:32:23,977 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:24,081 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:32:24,082 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:24,193 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 18 case distinctions, treesize of input 55 treesize of output 71 [2019-03-04 16:32:24,194 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-03-04 16:32:24,293 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2019-03-04 16:32:24,293 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:156, output treesize:153 [2019-03-04 16:32:24,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 46 treesize of output 69 [2019-03-04 16:32:24,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:24,573 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 62 [2019-03-04 16:32:24,574 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:24,727 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 51 treesize of output 73 [2019-03-04 16:32:24,729 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-03-04 16:32:24,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 16:32:24,920 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:25,032 INFO L309 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 4 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-03-04 16:32:25,032 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:190, output treesize:240 [2019-03-04 16:32:25,450 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 115 [2019-03-04 16:32:25,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:32:25,517 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:25,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 16:32:25,671 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:25,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 48 treesize of output 71 [2019-03-04 16:32:25,838 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:25,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 56 [2019-03-04 16:32:25,987 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:26,112 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:32:26,113 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:26,198 INFO L309 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 5 dim-1 vars, End of recursive call: 20 dim-0 vars, and 5 xjuncts. [2019-03-04 16:32:26,198 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 25 variables, input treesize:243, output treesize:193 [2019-03-04 16:32:26,415 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2019-03-04 16:32:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:26,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:26,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:32:26,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:32:26,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:32:26,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:32:26,436 INFO L87 Difference]: Start difference. First operand 8591 states and 60883 transitions. Second operand 14 states. [2019-03-04 16:32:26,712 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-03-04 16:32:26,938 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-03-04 16:32:27,351 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-03-04 16:32:27,587 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2019-03-04 16:32:29,373 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2019-03-04 16:32:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:42,489 INFO L93 Difference]: Finished difference Result 12803 states and 90726 transitions. [2019-03-04 16:32:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:32:42,490 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:32:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:42,534 INFO L225 Difference]: With dead ends: 12803 [2019-03-04 16:32:42,534 INFO L226 Difference]: Without dead ends: 12801 [2019-03-04 16:32:42,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:32:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12801 states. [2019-03-04 16:32:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12801 to 7967. [2019-03-04 16:32:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7967 states. [2019-03-04 16:32:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7967 states to 7967 states and 56581 transitions. [2019-03-04 16:32:52,144 INFO L78 Accepts]: Start accepts. Automaton has 7967 states and 56581 transitions. Word has length 7 [2019-03-04 16:32:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:52,144 INFO L480 AbstractCegarLoop]: Abstraction has 7967 states and 56581 transitions. [2019-03-04 16:32:52,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:32:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 7967 states and 56581 transitions. [2019-03-04 16:32:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:32:52,151 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:52,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:32:52,151 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:32:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1916214874, now seen corresponding path program 2 times [2019-03-04 16:32:52,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:52,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:32:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:52,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:52,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:32:52,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:32:52,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:32:52,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:32:52,336 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:32:52,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:52,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:32:52,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,350 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:32:52,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,361 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 26 treesize of output 28 [2019-03-04 16:32:52,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,373 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 28 treesize of output 30 [2019-03-04 16:32:52,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:32:52,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:32:52,419 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:32:52,420 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,433 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,446 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,459 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,473 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,486 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,543 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:32:52,543 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,550 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,564 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,581 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,605 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,632 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,679 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:32:52,679 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-03-04 16:32:52,727 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:32:52,728 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,772 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:32:52,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-03-04 16:32:52,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, 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:32:52,825 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,859 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:32:52,860 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-03-04 16:32:52,929 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 41 treesize of output 46 [2019-03-04 16:32:52,930 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:52,956 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:32:52,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:49 [2019-03-04 16:32:53,032 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 55 [2019-03-04 16:32:53,032 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:53,053 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:32:53,053 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:47 [2019-03-04 16:32:53,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, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 45 treesize of output 68 [2019-03-04 16:32:53,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:32:53,170 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:32:53,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:53 [2019-03-04 16:32:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:53,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:53,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:32:53,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:32:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:32:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:32:53,220 INFO L87 Difference]: Start difference. First operand 7967 states and 56581 transitions. Second operand 14 states. [2019-03-04 16:33:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:03,735 INFO L93 Difference]: Finished difference Result 8203 states and 57857 transitions. [2019-03-04 16:33:03,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:33:03,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:33:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:03,763 INFO L225 Difference]: With dead ends: 8203 [2019-03-04 16:33:03,763 INFO L226 Difference]: Without dead ends: 8198 [2019-03-04 16:33:03,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:33:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-03-04 16:33:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 1217. [2019-03-04 16:33:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-03-04 16:33:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 8301 transitions. [2019-03-04 16:33:09,441 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 8301 transitions. Word has length 7 [2019-03-04 16:33:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:09,441 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 8301 transitions. [2019-03-04 16:33:09,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:33:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 8301 transitions. [2019-03-04 16:33:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:33:09,443 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:09,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:33:09,443 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:33:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-03-04 16:33:09,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:09,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:09,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:33:09,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:09,500 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:33:09,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:09,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:33:09,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:09,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:33:09,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:09,545 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:33:09,546 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,556 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,569 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,588 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,615 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,647 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 21 treesize of output 24 [2019-03-04 16:33:09,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, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:33:09,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:33:09,673 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:33:09,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:33:09,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:33:09,685 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,697 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,707 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,719 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,731 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,743 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,785 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:09,785 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:33:09,818 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:33:09,819 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,858 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:09,858 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-03-04 16:33:09,897 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:33:09,898 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:09,927 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:33:09,927 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:53 [2019-03-04 16:33:09,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 43 treesize of output 55 [2019-03-04 16:33:09,988 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:33:10,033 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:33:10,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:98 [2019-03-04 16:33:10,084 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:33:10,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:10,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:33:10,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:33:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:33:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:33:10,102 INFO L87 Difference]: Start difference. First operand 1217 states and 8301 transitions. Second operand 10 states. [2019-03-04 16:33:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:15,809 INFO L93 Difference]: Finished difference Result 1295 states and 8586 transitions. [2019-03-04 16:33:15,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:33:15,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:33:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:15,816 INFO L225 Difference]: With dead ends: 1295 [2019-03-04 16:33:15,816 INFO L226 Difference]: Without dead ends: 1294 [2019-03-04 16:33:15,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:33:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-03-04 16:33:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1251. [2019-03-04 16:33:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2019-03-04 16:33:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 8539 transitions. [2019-03-04 16:33:21,332 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 8539 transitions. Word has length 7 [2019-03-04 16:33:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:21,332 INFO L480 AbstractCegarLoop]: Abstraction has 1251 states and 8539 transitions. [2019-03-04 16:33:21,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:33:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 8539 transitions. [2019-03-04 16:33:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:33:21,334 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:21,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:33:21,335 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:33:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1899287132, now seen corresponding path program 1 times [2019-03-04 16:33:21,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:21,415 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:33:21,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:21,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:33:21,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:21,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:33:21,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:21,433 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 21 treesize of output 24 [2019-03-04 16:33:21,443 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:33:21,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 34 [2019-03-04 16:33:21,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 28 treesize of output 39 [2019-03-04 16:33:21,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,513 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:33:21,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:33:21,535 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:33:21,535 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,547 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,560 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,572 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,583 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,595 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:33:21,626 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,634 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,649 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,677 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:33:21,678 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:59, output treesize:67 [2019-03-04 16:33:21,709 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:33:21,709 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,718 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:21,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-03-04 16:33:21,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:33:21,743 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:21,750 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:21,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2019-03-04 16:33:21,764 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:33:21,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:21,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:33:21,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:33:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:33:21,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:33:21,784 INFO L87 Difference]: Start difference. First operand 1251 states and 8539 transitions. Second operand 8 states. [2019-03-04 16:33:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:27,138 INFO L93 Difference]: Finished difference Result 1338 states and 8843 transitions. [2019-03-04 16:33:27,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:33:27,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:33:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:27,142 INFO L225 Difference]: With dead ends: 1338 [2019-03-04 16:33:27,142 INFO L226 Difference]: Without dead ends: 1337 [2019-03-04 16:33:27,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:33:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-03-04 16:33:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1277. [2019-03-04 16:33:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-03-04 16:33:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 8721 transitions. [2019-03-04 16:33:32,684 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 8721 transitions. Word has length 7 [2019-03-04 16:33:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:32,685 INFO L480 AbstractCegarLoop]: Abstraction has 1277 states and 8721 transitions. [2019-03-04 16:33:32,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:33:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 8721 transitions. [2019-03-04 16:33:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:33:32,687 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:32,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:33:32,687 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:33:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-03-04 16:33:32,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:32,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:32,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:32,784 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:33:32,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:32,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:33:32,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:32,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:33:32,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:32,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:33:32,829 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:32,840 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:32,856 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:32,879 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:32,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:33:32,919 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:33:32,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:33:32,928 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:33:32,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:33:32,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:33:32,974 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:32,985 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:32,997 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:33,008 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:33,019 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:33,031 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:33,060 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:33,061 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-03-04 16:33:33,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:33:33,106 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:33,122 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:33,122 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:33:33,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:33:33,152 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:33,163 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:33,163 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:33:33,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:33:33,208 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:33,220 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:33,221 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:33:33,238 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:33:33,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:33,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-03-04 16:33:33,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:33:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:33:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:33:33,258 INFO L87 Difference]: Start difference. First operand 1277 states and 8721 transitions. Second operand 11 states. [2019-03-04 16:33:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:39,056 INFO L93 Difference]: Finished difference Result 1355 states and 8928 transitions. [2019-03-04 16:33:39,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:33:39,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:33:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:39,061 INFO L225 Difference]: With dead ends: 1355 [2019-03-04 16:33:39,061 INFO L226 Difference]: Without dead ends: 1353 [2019-03-04 16:33:39,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:33:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2019-03-04 16:33:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1294. [2019-03-04 16:33:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-03-04 16:33:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 8840 transitions. [2019-03-04 16:33:44,744 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 8840 transitions. Word has length 7 [2019-03-04 16:33:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:44,745 INFO L480 AbstractCegarLoop]: Abstraction has 1294 states and 8840 transitions. [2019-03-04 16:33:44,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:33:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 8840 transitions. [2019-03-04 16:33:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:33:44,747 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:44,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:33:44,747 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:33:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-03-04 16:33:44,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:44,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:44,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:44,776 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:33:44,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:44,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:33:44,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:44,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:33:44,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:44,796 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 21 treesize of output 24 [2019-03-04 16:33:44,809 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:33:44,825 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 34 [2019-03-04 16:33:44,857 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 28 treesize of output 39 [2019-03-04 16:33:44,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 30 treesize of output 44 [2019-03-04 16:33:44,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:33:44,942 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:44,951 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:44,963 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:44,973 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:44,984 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:44,995 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:45,006 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:33:45,006 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-03-04 16:33:45,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-03-04 16:33:45,012 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:45,013 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:45,013 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-03-04 16:33:45,017 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:33:45,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:45,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-03-04 16:33:45,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:33:45,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:33:45,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:33:45,037 INFO L87 Difference]: Start difference. First operand 1294 states and 8840 transitions. Second operand 5 states. [2019-03-04 16:33:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:50,460 INFO L93 Difference]: Finished difference Result 1360 states and 9147 transitions. [2019-03-04 16:33:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:33:50,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:33:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:50,464 INFO L225 Difference]: With dead ends: 1360 [2019-03-04 16:33:50,464 INFO L226 Difference]: Without dead ends: 1351 [2019-03-04 16:33:50,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:33:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-03-04 16:33:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1338. [2019-03-04 16:33:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-03-04 16:33:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 9116 transitions. [2019-03-04 16:33:56,357 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 9116 transitions. Word has length 7 [2019-03-04 16:33:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:56,357 INFO L480 AbstractCegarLoop]: Abstraction has 1338 states and 9116 transitions. [2019-03-04 16:33:56,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:33:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 9116 transitions. [2019-03-04 16:33:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:33:56,360 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:56,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:33:56,360 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:33:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-03-04 16:33:56,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:56,415 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:33:56,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:56,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:33:56,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:56,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:33:56,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:56,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:33:56,498 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,508 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,522 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,544 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:33:56,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:33:56,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:33:56,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:33:56,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:33:56,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:33:56,638 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,648 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,659 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,670 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,681 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,692 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,721 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:33:56,721 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:33:56,757 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:33:56,757 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,774 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:56,774 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:33:56,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:33:56,803 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:33:56,815 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:33:56,815 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:33:56,836 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:33:56,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:33:56,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:33:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:33:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:33:56,854 INFO L87 Difference]: Start difference. First operand 1338 states and 9116 transitions. Second operand 8 states. [2019-03-04 16:34:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:02,370 INFO L93 Difference]: Finished difference Result 1354 states and 9131 transitions. [2019-03-04 16:34:02,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:34:02,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:34:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:02,374 INFO L225 Difference]: With dead ends: 1354 [2019-03-04 16:34:02,374 INFO L226 Difference]: Without dead ends: 1353 [2019-03-04 16:34:02,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:34:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2019-03-04 16:34:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1338. [2019-03-04 16:34:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-03-04 16:34:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 9116 transitions. [2019-03-04 16:34:08,239 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 9116 transitions. Word has length 7 [2019-03-04 16:34:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:08,239 INFO L480 AbstractCegarLoop]: Abstraction has 1338 states and 9116 transitions. [2019-03-04 16:34:08,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:34:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 9116 transitions. [2019-03-04 16:34:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:34:08,241 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:08,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:34:08,241 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:34:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1858652208, now seen corresponding path program 1 times [2019-03-04 16:34:08,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:08,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:08,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:08,386 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:34:08,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:08,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:34:08,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:08,400 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:34:08,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:08,405 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 21 treesize of output 24 [2019-03-04 16:34:08,420 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:34:08,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:34:08,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:34:08,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:34:08,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:08,478 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:34:08,478 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,491 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,503 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,516 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,528 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,541 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:34:08,592 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,598 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,613 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,634 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,659 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,703 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:34:08,703 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:34:08,731 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:34:08,732 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:08,773 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:34:08,774 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:34:08,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:34:08,824 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:34:08,881 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:34:08,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-03-04 16:34:08,925 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:34:08,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:08,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:34:08,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:34:08,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:34:08,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:34:08,944 INFO L87 Difference]: Start difference. First operand 1338 states and 9116 transitions. Second operand 8 states. [2019-03-04 16:34:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:14,713 INFO L93 Difference]: Finished difference Result 1360 states and 9136 transitions. [2019-03-04 16:34:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:34:14,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:34:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:14,717 INFO L225 Difference]: With dead ends: 1360 [2019-03-04 16:34:14,717 INFO L226 Difference]: Without dead ends: 1359 [2019-03-04 16:34:14,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:34:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-03-04 16:34:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1338. [2019-03-04 16:34:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-03-04 16:34:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 9116 transitions. [2019-03-04 16:34:20,524 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 9116 transitions. Word has length 7 [2019-03-04 16:34:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:20,525 INFO L480 AbstractCegarLoop]: Abstraction has 1338 states and 9116 transitions. [2019-03-04 16:34:20,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:34:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 9116 transitions. [2019-03-04 16:34:20,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:34:20,527 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:20,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:34:20,527 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:34:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:20,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1844427614, now seen corresponding path program 1 times [2019-03-04 16:34:20,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:20,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:20,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:20,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:20,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:20,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:20,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:34:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:20,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:34:20,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:20,637 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 21 treesize of output 24 [2019-03-04 16:34:20,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:34:20,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:34:20,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:34:20,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:34:20,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:20,980 INFO L301 Elim1Store]: Index analysis took 218 ms [2019-03-04 16:34:21,521 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:34:21,522 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:21,690 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:21,824 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:21,982 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:22,146 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:22,288 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:22,786 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:34:22,786 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:22,878 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:22,885 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:22,900 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:22,929 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:34:22,929 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-03-04 16:34:23,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, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 41 treesize of output 71 [2019-03-04 16:34:23,006 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:34:23,200 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2019-03-04 16:34:23,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:437 [2019-03-04 16:34:23,377 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 101 [2019-03-04 16:34:23,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 47 [2019-03-04 16:34:23,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:23,604 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 56 [2019-03-04 16:34:23,605 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:23,722 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 56 [2019-03-04 16:34:23,722 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:23,850 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 81 [2019-03-04 16:34:23,851 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:23,923 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-1 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-03-04 16:34:23,923 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 15 variables, input treesize:256, output treesize:162 [2019-03-04 16:34:24,064 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-03-04 16:34:24,121 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:34:24,122 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:24,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 58 [2019-03-04 16:34:24,251 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:34:24,382 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 74 [2019-03-04 16:34:24,384 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-03-04 16:34:24,573 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 45 [2019-03-04 16:34:24,573 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:24,680 INFO L309 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-1 vars, End of recursive call: 14 dim-0 vars, and 6 xjuncts. [2019-03-04 16:34:24,680 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:193, output treesize:211 [2019-03-04 16:34:24,876 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-03-04 16:34:24,906 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:34:24,906 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:24,996 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:34:24,996 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:25,094 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 39 treesize of output 55 [2019-03-04 16:34:25,095 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:25,181 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:34:25,181 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:25,226 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-03-04 16:34:25,226 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:161, output treesize:115 [2019-03-04 16:34:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:25,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:25,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:34:25,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:34:25,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:34:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:34:25,327 INFO L87 Difference]: Start difference. First operand 1338 states and 9116 transitions. Second operand 12 states. [2019-03-04 16:34:27,567 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2019-03-04 16:34:27,892 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-03-04 16:34:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:37,877 INFO L93 Difference]: Finished difference Result 1649 states and 10706 transitions. [2019-03-04 16:34:37,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:34:37,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:34:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:37,881 INFO L225 Difference]: With dead ends: 1649 [2019-03-04 16:34:37,881 INFO L226 Difference]: Without dead ends: 1648 [2019-03-04 16:34:37,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=87, Invalid=218, Unknown=1, NotChecked=0, Total=306 [2019-03-04 16:34:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-03-04 16:34:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1346. [2019-03-04 16:34:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2019-03-04 16:34:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 9172 transitions. [2019-03-04 16:34:43,794 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 9172 transitions. Word has length 7 [2019-03-04 16:34:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:43,795 INFO L480 AbstractCegarLoop]: Abstraction has 1346 states and 9172 transitions. [2019-03-04 16:34:43,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:34:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 9172 transitions. [2019-03-04 16:34:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:34:43,797 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:43,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:34:43,797 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:34:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1855152374, now seen corresponding path program 2 times [2019-03-04 16:34:43,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:43,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:43,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:34:43,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:43,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:34:43,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:34:43,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:34:43,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:34:43,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:34:43,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:43,971 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 21 treesize of output 24 [2019-03-04 16:34:43,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:34:43,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:43,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:43,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:34:43,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:43,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:43,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:43,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:43,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:34:44,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:34:44,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:34:44,038 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:34:44,039 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,052 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,064 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,077 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,090 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,103 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:34:44,152 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,158 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,170 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,191 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,216 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,257 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:34:44,257 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:34:44,292 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:34:44,292 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,331 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:34:44,332 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:34:44,384 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:34:44,385 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:34:44,442 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:34:44,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:122 [2019-03-04 16:34:44,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 45 [2019-03-04 16:34:44,532 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,551 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:34:44,552 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-03-04 16:34:44,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 48 [2019-03-04 16:34:44,612 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:34:44,625 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:34:44,625 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:34:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:44,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:44,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:34:44,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:34:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:34:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:34:44,665 INFO L87 Difference]: Start difference. First operand 1346 states and 9172 transitions. Second operand 11 states. [2019-03-04 16:34:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:56,067 INFO L93 Difference]: Finished difference Result 2017 states and 13299 transitions. [2019-03-04 16:34:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:34:56,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:34:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:56,073 INFO L225 Difference]: With dead ends: 2017 [2019-03-04 16:34:56,073 INFO L226 Difference]: Without dead ends: 2015 [2019-03-04 16:34:56,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:34:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-03-04 16:35:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1839. [2019-03-04 16:35:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-03-04 16:35:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 12623 transitions. [2019-03-04 16:35:07,132 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 12623 transitions. Word has length 7 [2019-03-04 16:35:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:35:07,132 INFO L480 AbstractCegarLoop]: Abstraction has 1839 states and 12623 transitions. [2019-03-04 16:35:07,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:35:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 12623 transitions. [2019-03-04 16:35:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:35:07,136 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:35:07,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:35:07,136 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:35:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:35:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1855377184, now seen corresponding path program 1 times [2019-03-04 16:35:07,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:35:07,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:35:07,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:07,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:35:07,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:07,187 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:35:07,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:35:07,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:35:07,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:35:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:07,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:35:07,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:35:07,205 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 21 treesize of output 24 [2019-03-04 16:35:07,221 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:35:07,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,231 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:35:07,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,243 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:35:07,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,261 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:35:07,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:07,317 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:35:07,317 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,330 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,341 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,354 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,365 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,378 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,416 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:35:07,417 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,423 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,434 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,450 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:07,481 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:35:07,482 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:35:07,694 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-03-04 16:35:07,742 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 41 treesize of output 71 [2019-03-04 16:35:07,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:35:07,948 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-03-04 16:35:07,948 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:437 [2019-03-04 16:35:08,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 79 [2019-03-04 16:35:08,097 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:35:08,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 49 [2019-03-04 16:35:08,288 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:08,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 67 [2019-03-04 16:35:08,411 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-03-04 16:35:08,543 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 17 dim-0 vars, and 5 xjuncts. [2019-03-04 16:35:08,543 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:198, output treesize:194 [2019-03-04 16:35:08,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:35:08,701 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:08,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:35:08,781 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:08,845 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 16:35:08,846 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:08,886 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:35:08,887 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-03-04 16:35:08,939 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:35:08,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:35:08,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:35:08,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:35:08,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:35:08,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:35:08,957 INFO L87 Difference]: Start difference. First operand 1839 states and 12623 transitions. Second operand 10 states. [2019-03-04 16:35:09,345 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-03-04 16:35:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:35:20,757 INFO L93 Difference]: Finished difference Result 1987 states and 13345 transitions. [2019-03-04 16:35:20,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:35:20,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:35:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:35:20,763 INFO L225 Difference]: With dead ends: 1987 [2019-03-04 16:35:20,763 INFO L226 Difference]: Without dead ends: 1986 [2019-03-04 16:35:20,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:35:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-03-04 16:35:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1854. [2019-03-04 16:35:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-03-04 16:35:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 12728 transitions. [2019-03-04 16:35:31,922 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 12728 transitions. Word has length 7 [2019-03-04 16:35:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:35:31,922 INFO L480 AbstractCegarLoop]: Abstraction has 1854 states and 12728 transitions. [2019-03-04 16:35:31,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:35:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 12728 transitions. [2019-03-04 16:35:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:35:31,925 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:35:31,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:35:31,925 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:35:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:35:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1851264040, now seen corresponding path program 1 times [2019-03-04 16:35:31,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:35:31,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:35:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:31,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:35:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:31,971 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:35:31,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:35:31,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:35:31,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:35:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:31,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:35:31,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:35:31,989 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 21 treesize of output 24 [2019-03-04 16:35:32,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:35:32,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:35:32,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:35:32,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,054 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:35:32,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:35:32,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:35:32,078 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,091 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,105 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,118 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,132 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,146 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,195 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:35:32,196 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,202 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,211 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,227 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,253 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,296 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:35:32,296 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:35:32,321 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:35:32,322 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,361 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:35:32,361 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:69 [2019-03-04 16:35:32,397 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:35:32,398 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:32,427 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:35:32,428 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:53 [2019-03-04 16:35:32,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:35:32,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:35:32,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:35:32,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:35:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:35:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:35:32,468 INFO L87 Difference]: Start difference. First operand 1854 states and 12728 transitions. Second operand 8 states. [2019-03-04 16:35:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:35:42,948 INFO L93 Difference]: Finished difference Result 1879 states and 12751 transitions. [2019-03-04 16:35:42,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:35:42,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:35:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:35:42,953 INFO L225 Difference]: With dead ends: 1879 [2019-03-04 16:35:42,953 INFO L226 Difference]: Without dead ends: 1878 [2019-03-04 16:35:42,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:35:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-03-04 16:35:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1854. [2019-03-04 16:35:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-03-04 16:35:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 12728 transitions. [2019-03-04 16:35:54,208 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 12728 transitions. Word has length 7 [2019-03-04 16:35:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:35:54,209 INFO L480 AbstractCegarLoop]: Abstraction has 1854 states and 12728 transitions. [2019-03-04 16:35:54,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:35:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 12728 transitions. [2019-03-04 16:35:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:35:54,212 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:35:54,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:35:54,212 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:35:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:35:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2042693204, now seen corresponding path program 3 times [2019-03-04 16:35:54,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:35:54,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:35:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:54,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:35:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:54,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:35:54,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:35:54,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:35:54,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:35:54,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:35:54,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:35:54,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:35:54,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:35:54,339 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,347 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,359 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,381 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,408 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,436 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:35:54,476 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-03-04 16:35:54,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:35:54,482 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 28 treesize of output 30 [2019-03-04 16:35:54,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:35:54,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:35:54,490 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,501 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,513 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,524 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,536 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,547 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,591 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:35:54,592 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-03-04 16:35:54,625 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:35:54,625 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,667 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:35:54,668 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:73 [2019-03-04 16:35:54,704 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:35:54,704 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,732 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:35:54,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-03-04 16:35:54,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, 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:35:54,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,820 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:35:54,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-03-04 16:35:54,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 43 treesize of output 55 [2019-03-04 16:35:54,890 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:35:54,911 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:35:54,911 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-03-04 16:35:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:54,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:35:54,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:35:54,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:35:54,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:35:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:35:54,955 INFO L87 Difference]: Start difference. First operand 1854 states and 12728 transitions. Second operand 12 states. [2019-03-04 16:36:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:05,914 INFO L93 Difference]: Finished difference Result 1889 states and 12772 transitions. [2019-03-04 16:36:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:36:05,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:36:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:05,921 INFO L225 Difference]: With dead ends: 1889 [2019-03-04 16:36:05,921 INFO L226 Difference]: Without dead ends: 1888 [2019-03-04 16:36:05,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:36:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2019-03-04 16:36:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 250. [2019-03-04 16:36:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-03-04 16:36:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1533 transitions. [2019-03-04 16:36:08,068 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1533 transitions. Word has length 7 [2019-03-04 16:36:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:08,068 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1533 transitions. [2019-03-04 16:36:08,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:36:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1533 transitions. [2019-03-04 16:36:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:36:08,069 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:08,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:36:08,069 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2042773992, now seen corresponding path program 2 times [2019-03-04 16:36:08,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:08,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:08,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:08,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:36:08,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:36:08,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:08,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:36:08,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:36:08,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:36:08,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:36:08,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:36:08,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:08,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:36:08,228 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,232 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,243 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,264 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,291 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:36:08,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:36:08,344 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:36:08,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:36:08,355 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:36:08,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:36:08,361 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,373 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,384 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,396 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,408 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,420 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,462 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:36:08,462 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-03-04 16:36:08,498 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 41 treesize of output 43 [2019-03-04 16:36:08,499 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:36:08,566 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:36:08,566 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:142 [2019-03-04 16:36:08,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:36:08,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,693 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:36:08,693 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:78, output treesize:40 [2019-03-04 16:36:08,741 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:36:08,742 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:08,758 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:36:08,758 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:36:08,780 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:36:08,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:08,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:36:08,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:36:08,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:36:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:36:08,800 INFO L87 Difference]: Start difference. First operand 250 states and 1533 transitions. Second operand 10 states. [2019-03-04 16:36:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:13,353 INFO L93 Difference]: Finished difference Result 381 states and 2013 transitions. [2019-03-04 16:36:13,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:36:13,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:36:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:13,356 INFO L225 Difference]: With dead ends: 381 [2019-03-04 16:36:13,356 INFO L226 Difference]: Without dead ends: 377 [2019-03-04 16:36:13,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:36:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-03-04 16:36:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 278. [2019-03-04 16:36:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-03-04 16:36:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 1729 transitions. [2019-03-04 16:36:16,918 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 1729 transitions. Word has length 7 [2019-03-04 16:36:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:16,918 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 1729 transitions. [2019-03-04 16:36:16,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:36:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 1729 transitions. [2019-03-04 16:36:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:36:16,919 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:16,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:36:16,919 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2042895142, now seen corresponding path program 1 times [2019-03-04 16:36:16,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:16,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:16,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:36:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:17,025 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:36:17,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:17,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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:36:17,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:36:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:17,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:36:17,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:17,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:36:17,061 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,068 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,079 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,094 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:36:17,127 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:36:17,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:36:17,138 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:36:17,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:36:17,182 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:36:17,183 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,193 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,204 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,215 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,227 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,238 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,268 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:36:17,269 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-03-04 16:36:17,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:36:17,321 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:36:17,363 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:36:17,363 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:36:17,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:36:17,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:17,429 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:36:17,429 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 [2019-03-04 16:36:17,448 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:36:17,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:17,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-03-04 16:36:17,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:36:17,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:36:17,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:36:17,467 INFO L87 Difference]: Start difference. First operand 278 states and 1729 transitions. Second operand 9 states. [2019-03-04 16:36:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:22,851 INFO L93 Difference]: Finished difference Result 346 states and 2000 transitions. [2019-03-04 16:36:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:36:22,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:36:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:22,853 INFO L225 Difference]: With dead ends: 346 [2019-03-04 16:36:22,854 INFO L226 Difference]: Without dead ends: 342 [2019-03-04 16:36:22,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:36:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-03-04 16:36:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 307. [2019-03-04 16:36:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-03-04 16:36:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 1931 transitions. [2019-03-04 16:36:28,335 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 1931 transitions. Word has length 7 [2019-03-04 16:36:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:28,335 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 1931 transitions. [2019-03-04 16:36:28,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:36:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 1931 transitions. [2019-03-04 16:36:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:36:28,336 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:28,336 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:36:28,336 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:28,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1824818784, now seen corresponding path program 1 times [2019-03-04 16:36:28,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:36:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:36:28,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:36:28,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:36:28,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:36:28,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:36:28,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:36:28,424 INFO L87 Difference]: Start difference. First operand 307 states and 1931 transitions. Second operand 4 states. [2019-03-04 16:36:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:33,438 INFO L93 Difference]: Finished difference Result 312 states and 1935 transitions. [2019-03-04 16:36:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:36:33,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-03-04 16:36:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:33,440 INFO L225 Difference]: With dead ends: 312 [2019-03-04 16:36:33,440 INFO L226 Difference]: Without dead ends: 307 [2019-03-04 16:36:33,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:36:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-03-04 16:36:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-03-04 16:36:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-03-04 16:36:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 1929 transitions. [2019-03-04 16:36:38,824 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 1929 transitions. Word has length 8 [2019-03-04 16:36:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:38,825 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 1929 transitions. [2019-03-04 16:36:38,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:36:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 1929 transitions. [2019-03-04 16:36:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:36:38,825 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:38,825 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:36:38,825 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1460889942, now seen corresponding path program 1 times [2019-03-04 16:36:38,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:38,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:38,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:36:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:36:38,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:38,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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:36:38,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:36:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:38,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:36:38,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:38,962 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 21 treesize of output 24 [2019-03-04 16:36:38,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:36:38,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:36:38,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,993 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:36:38,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:38,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:36:39,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:36:39,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:36:39,059 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,071 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,083 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,096 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,108 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,120 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:36:39,155 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,160 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,168 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,183 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,212 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:36:39,212 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-03-04 16:36:39,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, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:36:39,244 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,268 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:36:39,269 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:36:39,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:36:39,306 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:36:39,344 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:36:39,344 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:76 [2019-03-04 16:36:39,385 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:36:39,386 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:39,398 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:36:39,398 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:36:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:39,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:39,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:36:39,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:36:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:36:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:36:39,433 INFO L87 Difference]: Start difference. First operand 307 states and 1929 transitions. Second operand 10 states. [2019-03-04 16:36:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:46,372 INFO L93 Difference]: Finished difference Result 426 states and 2385 transitions. [2019-03-04 16:36:46,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:36:46,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:36:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:46,375 INFO L225 Difference]: With dead ends: 426 [2019-03-04 16:36:46,375 INFO L226 Difference]: Without dead ends: 425 [2019-03-04 16:36:46,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:36:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-03-04 16:36:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 313. [2019-03-04 16:36:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-03-04 16:36:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 1971 transitions. [2019-03-04 16:36:53,048 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 1971 transitions. Word has length 8 [2019-03-04 16:36:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:53,048 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 1971 transitions. [2019-03-04 16:36:53,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:36:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 1971 transitions. [2019-03-04 16:36:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:36:53,049 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:53,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:36:53,050 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1476975096, now seen corresponding path program 1 times [2019-03-04 16:36:53,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:53,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:53,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:53,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:36:53,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:36:53,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:53,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:36:53,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:36:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:53,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:36:53,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:53,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:36:53,241 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,250 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,263 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,281 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,306 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,339 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 21 treesize of output 24 [2019-03-04 16:36:53,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:36:53,356 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:36:53,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:36:53,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:36:53,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:36:53,373 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,384 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,395 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,406 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,417 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,429 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,469 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:36:53,469 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-03-04 16:36:53,512 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:36:53,513 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,551 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:36:53,551 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:97, output treesize:69 [2019-03-04 16:36:53,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:36:53,607 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:36:53,656 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:36:53,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:110 [2019-03-04 16:36:53,789 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:36:53,789 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,868 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:36:53,869 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:53,907 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:36:53,907 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:122, output treesize:90 [2019-03-04 16:36:54,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, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 61 treesize of output 73 [2019-03-04 16:36:54,003 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:54,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 48 treesize of output 67 [2019-03-04 16:36:54,097 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:36:54,139 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-03-04 16:36:54,139 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:110, output treesize:100 [2019-03-04 16:36:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:54,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:54,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:36:54,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:36:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:36:54,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:36:54,233 INFO L87 Difference]: Start difference. First operand 313 states and 1971 transitions. Second operand 12 states. [2019-03-04 16:36:54,613 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-03-04 16:36:54,791 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-03-04 16:37:00,973 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-03-04 16:37:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:37:02,105 INFO L93 Difference]: Finished difference Result 352 states and 2026 transitions. [2019-03-04 16:37:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:37:02,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:37:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:37:02,107 INFO L225 Difference]: With dead ends: 352 [2019-03-04 16:37:02,107 INFO L226 Difference]: Without dead ends: 351 [2019-03-04 16:37:02,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:37:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-03-04 16:37:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 314. [2019-03-04 16:37:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-03-04 16:37:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1978 transitions. [2019-03-04 16:37:08,850 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1978 transitions. Word has length 8 [2019-03-04 16:37:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:37:08,850 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1978 transitions. [2019-03-04 16:37:08,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:37:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1978 transitions. [2019-03-04 16:37:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:37:08,851 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:37:08,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:37:08,851 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:37:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:37:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1468156960, now seen corresponding path program 1 times [2019-03-04 16:37:08,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:37:08,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:37:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:37:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:37:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:37:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:37:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:37:08,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:37:08,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:37:08,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:37:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:37:08,941 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:37:08,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:37:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-03-04 16:37:08,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:37:08,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,965 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:37:08,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:37:08,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,993 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:37:08,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:08,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:09,016 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:37:09,016 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,029 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,042 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,055 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,067 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,080 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,127 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:37:09,127 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,132 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,144 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,162 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,187 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,227 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:37:09,227 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:37:09,265 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:37:09,265 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:37:09,304 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2019-03-04 16:37:09,354 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:37:09,354 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:37:09,404 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:37:09,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:110 [2019-03-04 16:37:09,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:37:09,465 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,483 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:37:09,483 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:36 [2019-03-04 16:37:09,549 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:37:09,550 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:09,567 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:37:09,567 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:38 [2019-03-04 16:37:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:37:09,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:37:09,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:37:09,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:37:09,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:37:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:37:09,818 INFO L87 Difference]: Start difference. First operand 314 states and 1978 transitions. Second operand 12 states. [2019-03-04 16:37:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:37:20,824 INFO L93 Difference]: Finished difference Result 471 states and 2490 transitions. [2019-03-04 16:37:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:37:20,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:37:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:37:20,826 INFO L225 Difference]: With dead ends: 471 [2019-03-04 16:37:20,827 INFO L226 Difference]: Without dead ends: 468 [2019-03-04 16:37:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:37:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-03-04 16:37:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 317. [2019-03-04 16:37:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-03-04 16:37:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1999 transitions. [2019-03-04 16:37:29,505 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1999 transitions. Word has length 8 [2019-03-04 16:37:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:37:29,505 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 1999 transitions. [2019-03-04 16:37:29,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:37:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1999 transitions. [2019-03-04 16:37:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:37:29,506 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:37:29,506 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:37:29,507 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:37:29,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:37:29,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1929500386, now seen corresponding path program 2 times [2019-03-04 16:37:29,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:37:29,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:37:29,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:37:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:37:29,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:37:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:37:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:37:29,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:37:29,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:37:29,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:37:29,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:37:29,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:37:29,597 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:37:29,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:37:29,601 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 21 treesize of output 24 [2019-03-04 16:37:29,614 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:37:29,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:37:29,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:37:29,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:37:29,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:29,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2019-03-04 16:37:29,669 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,682 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,694 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,707 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,720 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,733 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:37:29,781 INFO L309 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,787 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,799 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,817 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,841 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,882 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:37:29,883 INFO L209 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-03-04 16:37:29,917 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:37:29,917 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:29,956 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:37:29,956 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:97, output treesize:69 [2019-03-04 16:37:30,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:37:30,001 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:30,030 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:37:30,031 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:53 [2019-03-04 16:37:30,114 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 43 treesize of output 65 [2019-03-04 16:37:30,115 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:30,139 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:37:30,140 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:53 [2019-03-04 16:37:30,203 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 43 treesize of output 55 [2019-03-04 16:37:30,204 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:37:30,247 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:37:30,247 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-03-04 16:37:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:37:30,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:37:30,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:37:30,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:37:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:37:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:37:30,310 INFO L87 Difference]: Start difference. First operand 317 states and 1999 transitions. Second operand 11 states. [2019-03-04 16:37:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:37:40,242 INFO L93 Difference]: Finished difference Result 383 states and 2178 transitions. [2019-03-04 16:37:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:37:40,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:37:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:37:40,244 INFO L225 Difference]: With dead ends: 383 [2019-03-04 16:37:40,244 INFO L226 Difference]: Without dead ends: 382 [2019-03-04 16:37:40,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:37:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-03-04 16:37:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 327. [2019-03-04 16:37:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-03-04 16:37:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 2069 transitions. [2019-03-04 16:37:50,555 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 2069 transitions. Word has length 8 [2019-03-04 16:37:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:37:50,555 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 2069 transitions. [2019-03-04 16:37:50,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:37:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 2069 transitions. [2019-03-04 16:37:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:37:50,556 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:37:50,556 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:37:50,556 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:37:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:37:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1933732694, now seen corresponding path program 1 times [2019-03-04 16:37:50,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:37:50,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:37:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:37:50,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:37:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:37:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:37:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:37:50,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:37:50,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:37:50,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:37:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:37:50,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:37:50,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:37:50,612 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 21 treesize of output 24 [2019-03-04 16:37:50,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-03-04 16:37:50,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 34 [2019-03-04 16:37:50,681 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 28 treesize of output 39 [2019-03-04 16:37:50,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,695 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:37:50,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:37:50,749 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:37:50,749 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,761 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,772 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,784 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,795 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,807 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:37:50,829 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,836 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,854 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:37:50,854 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:39, output treesize:47 [2019-03-04 16:37:50,876 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:37:50,876 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,881 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-03-04 16:37:50,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:37:50,901 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,906 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,907 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:13 [2019-03-04 16:37:50,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 21 [2019-03-04 16:37:50,924 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:37:50,927 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:37:50,927 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-03-04 16:37:50,936 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:37:50,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:37:50,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:37:50,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:37:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:37:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:37:50,956 INFO L87 Difference]: Start difference. First operand 327 states and 2069 transitions. Second operand 9 states. [2019-03-04 16:38:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:09,147 INFO L93 Difference]: Finished difference Result 518 states and 3060 transitions. [2019-03-04 16:38:09,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:38:09,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:38:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:09,149 INFO L225 Difference]: With dead ends: 518 [2019-03-04 16:38:09,149 INFO L226 Difference]: Without dead ends: 509 [2019-03-04 16:38:09,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states.