java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 18:08:01,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 18:08:01,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 18:08:01,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 18:08:01,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 18:08:01,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 18:08:01,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 18:08:01,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 18:08:01,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 18:08:01,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 18:08:01,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 18:08:01,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 18:08:01,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 18:08:01,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 18:08:01,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 18:08:01,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 18:08:01,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 18:08:01,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 18:08:01,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 18:08:01,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 18:08:01,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 18:08:01,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 18:08:01,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 18:08:01,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 18:08:01,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 18:08:01,314 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 18:08:01,315 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 18:08:01,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 18:08:01,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 18:08:01,320 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 18:08:01,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 18:08:01,321 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 18:08:01,321 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 18:08:01,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 18:08:01,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 18:08:01,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 18:08:01,325 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 18:08:01,349 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 18:08:01,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 18:08:01,353 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 18:08:01,353 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 18:08:01,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 18:08:01,354 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 18:08:01,354 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 18:08:01,354 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 18:08:01,354 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 18:08:01,355 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 18:08:01,355 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 18:08:01,355 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 18:08:01,355 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 18:08:01,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 18:08:01,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 18:08:01,356 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 18:08:01,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 18:08:01,357 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 18:08:01,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 18:08:01,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 18:08:01,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 18:08:01,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 18:08:01,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 18:08:01,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 18:08:01,359 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 18:08:01,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 18:08:01,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 18:08:01,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 18:08:01,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 18:08:01,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 18:08:01,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 18:08:01,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 18:08:01,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 18:08:01,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 18:08:01,361 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 18:08:01,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 18:08:01,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 18:08:01,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 18:08:01,362 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 18:08:01,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 18:08:01,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 18:08:01,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 18:08:01,413 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 18:08:01,413 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 18:08:01,414 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-18 18:08:01,414 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-18 18:08:01,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 18:08:01,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 18:08:01,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 18:08:01,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 18:08:01,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 18:08:01,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 18:08:01,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 18:08:01,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 18:08:01,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 18:08:01,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/1) ... [2019-01-18 18:08:01,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 18:08:01,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 18:08:01,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 18:08:01,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 18:08:01,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (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-01-18 18:08:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 18:08:01,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 18:08:01,843 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 18:08:01,843 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-18 18:08:01,845 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:08:01 BoogieIcfgContainer [2019-01-18 18:08:01,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 18:08:01,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 18:08:01,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 18:08:01,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 18:08:01,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:08:01" (1/2) ... [2019-01-18 18:08:01,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad73833 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 06:08:01, skipping insertion in model container [2019-01-18 18:08:01,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:08:01" (2/2) ... [2019-01-18 18:08:01,860 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-18 18:08:01,882 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 18:08:01,900 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-18 18:08:01,945 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-18 18:08:02,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 18:08:02,013 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 18:08:02,013 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 18:08:02,013 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 18:08:02,013 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 18:08:02,013 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 18:08:02,016 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 18:08:02,016 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 18:08:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-18 18:08:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 18:08:02,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:02,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 18:08:02,054 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-18 18:08:02,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:02,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:02,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:02,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:02,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:02,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:02,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:08:02,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:02,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:08:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:08:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:08:02,250 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-18 18:08:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:02,464 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-18 18:08:02,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:02,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 18:08:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:02,479 INFO L225 Difference]: With dead ends: 25 [2019-01-18 18:08:02,479 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 18:08:02,483 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-01-18 18:08:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 18:08:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-18 18:08:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 18:08:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-18 18:08:02,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-18 18:08:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:02,515 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-18 18:08:02,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:08:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-18 18:08:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:02,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:02,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:02,516 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:02,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:02,517 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-18 18:08:02,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:02,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:02,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:02,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:02,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:02,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:08:02,662 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-18 18:08:02,740 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:02,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:03,817 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:03,870 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:03,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:03,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:03,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:03,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:03,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:03,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:04,099 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-18 18:08:04,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,125 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:04,356 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-18 18:08:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,419 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:04,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:04,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:04,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:04,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:04,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:04,883 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:04,884 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,961 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,975 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:05,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:05,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:05,044 INFO L267 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-01-18 18:08:05,044 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:05,271 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-18 18:08:05,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:05,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:08:05,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:05,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:05,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:05,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:05,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:05,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:08:05,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:05,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:08:05,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:08:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:05,731 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-18 18:08:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:06,066 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-18 18:08:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:06,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 18:08:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:06,068 INFO L225 Difference]: With dead ends: 39 [2019-01-18 18:08:06,068 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 18:08:06,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:08:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 18:08:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-18 18:08:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 18:08:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-18 18:08:06,074 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-18 18:08:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:06,074 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-18 18:08:06,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:08:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-18 18:08:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:06,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:06,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:06,076 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:06,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-18 18:08:06,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:06,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:06,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:06,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:06,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:06,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:08:06,169 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-18 18:08:06,170 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:06,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:09,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:09,161 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:09,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:09,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:09,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:09,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:09,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:09,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,236 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:09,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,306 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:09,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:09,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:09,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:09,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:09,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:09,467 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:09,467 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,514 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,550 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,565 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:09,634 INFO L267 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-01-18 18:08:09,635 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:09,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:08:09,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 18:08:10,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-18 18:08:10,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:199 [2019-01-18 18:08:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:10,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:10,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:08:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 18:08:10,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:10,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 18:08:10,136 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-18 18:08:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:10,193 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-18 18:08:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:10,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:08:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:10,196 INFO L225 Difference]: With dead ends: 18 [2019-01-18 18:08:10,197 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 18:08:10,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 18:08:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 18:08:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 18:08:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 18:08:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-18 18:08:10,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-18 18:08:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:10,202 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-18 18:08:10,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-18 18:08:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:10,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:10,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:10,204 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-18 18:08:10,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:10,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:10,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:10,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:10,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:10,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:10,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:08:10,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:10,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:08:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:08:10,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:08:10,259 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-18 18:08:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:10,306 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-18 18:08:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:10,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 18:08:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:10,309 INFO L225 Difference]: With dead ends: 21 [2019-01-18 18:08:10,309 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 18:08:10,309 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-01-18 18:08:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 18:08:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-18 18:08:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 18:08:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-18 18:08:10,313 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-18 18:08:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:10,314 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-18 18:08:10,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:08:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-18 18:08:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:10,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:10,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:10,315 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:10,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-18 18:08:10,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:10,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:10,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:10,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:10,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:10,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:10,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:08:10,413 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-18 18:08:10,417 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:10,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:10,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:10,718 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:10,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:10,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:10,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:10,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:10,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:10,887 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-18 18:08:10,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:10,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:10,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:10,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:10,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:11,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:11,158 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-18 18:08:11,159 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:11,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,264 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:11,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,291 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:11,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:11,339 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,352 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,362 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,384 INFO L267 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-01-18 18:08:11,385 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:11,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:08:11,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:11,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:11,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:11,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:11,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:08:11,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:11,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:08:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:08:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:11,495 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-18 18:08:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:11,716 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-18 18:08:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:11,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 18:08:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:11,720 INFO L225 Difference]: With dead ends: 39 [2019-01-18 18:08:11,720 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 18:08:11,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:08:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 18:08:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-18 18:08:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 18:08:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-18 18:08:11,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-18 18:08:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:11,726 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-18 18:08:11,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:08:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-18 18:08:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:11,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:11,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:11,727 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:11,728 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-18 18:08:11,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:11,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:11,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-01-18 18:08:11,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:11,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:11,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:11,799 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-18 18:08:11,801 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:11,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:12,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:12,232 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:12,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:12,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:12,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:12,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:12,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:12,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:12,397 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-18 18:08:12,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:12,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:12,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:12,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:12,590 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:12,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,790 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:12,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,815 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:12,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:12,867 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,876 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,886 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:12,907 INFO L267 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-01-18 18:08:12,907 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:12,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:12,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-18 18:08:12,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:08:13,024 INFO L267 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-01-18 18:08:13,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-18 18:08:13,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 18:08:13,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-18 18:08:13,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:13,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-18 18:08:13,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:13,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-18 18:08:13,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-18 18:08:15,573 WARN L181 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-01-18 18:08:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:15,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:15,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:15,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:15,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:15,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:15,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:15,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:15,658 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-18 18:08:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:16,164 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-18 18:08:16,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:16,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:16,167 INFO L225 Difference]: With dead ends: 59 [2019-01-18 18:08:16,167 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 18:08:16,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 18:08:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-18 18:08:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 18:08:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-18 18:08:16,174 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-18 18:08:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:16,174 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-18 18:08:16,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-18 18:08:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:16,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:16,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:16,175 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:16,176 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-18 18:08:16,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:16,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:16,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:16,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:16,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:16,223 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:16,224 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-18 18:08:16,225 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:16,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:16,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:16,434 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:16,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:16,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:16,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:16,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:16,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:16,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:16,458 INFO L478 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 21 treesize of output 23 [2019-01-18 18:08:16,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,470 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:08:16,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,483 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:08:16,500 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:08:16,500 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:08:16,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,612 INFO L478 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 22 treesize of output 38 [2019-01-18 18:08:16,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:08:16,649 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,657 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,666 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,688 INFO L267 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-01-18 18:08:16,689 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 18:08:16,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,719 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-18 18:08:16,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:16,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-18 18:08:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:16,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:16,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:08:16,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 18:08:16,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:16,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:16,800 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-18 18:08:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:16,905 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-18 18:08:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:16,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 18:08:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:16,906 INFO L225 Difference]: With dead ends: 25 [2019-01-18 18:08:16,907 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 18:08:16,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 18:08:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-18 18:08:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 18:08:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-18 18:08:16,921 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-18 18:08:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:16,922 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-18 18:08:16,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-18 18:08:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:16,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:16,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:16,926 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-18 18:08:16,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:16,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:17,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-01-18 18:08:17,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:17,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:17,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:17,070 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-18 18:08:17,071 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:17,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:17,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:17,388 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:17,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:17,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:17,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:17,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:17,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:17,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:17,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:17,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:17,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:17,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:17,455 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:17,456 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,489 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,548 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:17,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,575 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:17,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:17,633 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,641 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,671 INFO L267 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-01-18 18:08:17,671 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:17,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:08:17,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:17,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:17,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,804 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:17,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-18 18:08:17,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:17,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-18 18:08:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:17,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:17,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:17,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:17,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:17,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:17,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:17,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:17,922 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-18 18:08:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:18,375 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-18 18:08:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:18,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:18,377 INFO L225 Difference]: With dead ends: 56 [2019-01-18 18:08:18,377 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 18:08:18,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 18:08:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-18 18:08:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 18:08:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-18 18:08:18,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-18 18:08:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:18,386 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-18 18:08:18,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-18 18:08:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:18,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:18,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:18,387 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-18 18:08:18,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:18,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:18,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:18,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:18,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:18,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:18,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:18,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:18,465 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-18 18:08:18,466 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:18,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:18,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:18,830 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:18,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:18,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:18,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:18,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:18,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:18,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:18,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,895 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:18,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,945 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:18,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:18,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:19,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:19,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:19,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:19,031 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:19,032 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,089 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,108 INFO L267 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-01-18 18:08:19,108 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:19,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:08:19,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:19,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:19,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 18:08:19,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:19,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:19,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:19,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:19,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:19,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:19,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:19,278 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-18 18:08:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:19,609 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-18 18:08:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:19,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:19,610 INFO L225 Difference]: With dead ends: 52 [2019-01-18 18:08:19,610 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 18:08:19,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 18:08:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-18 18:08:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 18:08:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-18 18:08:19,619 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-18 18:08:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:19,619 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-18 18:08:19,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-18 18:08:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:19,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:19,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:19,620 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-18 18:08:19,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:19,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:19,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:19,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:19,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:19,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:19,716 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:19,716 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-18 18:08:19,717 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:19,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:21,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:21,396 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:21,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:21,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:21,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:21,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:21,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:21,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:21,437 INFO L478 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 21 treesize of output 23 [2019-01-18 18:08:21,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,447 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:08:21,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,458 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:08:21,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:08:21,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,555 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:08:21,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,628 INFO L478 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 36 treesize of output 49 [2019-01-18 18:08:21,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,662 INFO L478 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 32 treesize of output 57 [2019-01-18 18:08:21,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:08:21,715 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,730 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,744 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,760 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,788 INFO L267 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-01-18 18:08:21,788 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 18:08:21,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:08:21,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:21,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-18 18:08:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:21,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:21,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:21,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:08:21,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:21,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:08:21,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:08:21,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:21,881 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-18 18:08:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:22,066 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-18 18:08:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:22,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 18:08:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:22,067 INFO L225 Difference]: With dead ends: 42 [2019-01-18 18:08:22,067 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 18:08:22,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:08:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 18:08:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-18 18:08:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 18:08:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-18 18:08:22,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-18 18:08:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:22,075 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-18 18:08:22,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:08:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-18 18:08:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:22,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:22,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:22,076 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-18 18:08:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:22,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:22,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:22,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:22,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:22,178 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-18 18:08:22,180 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:22,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:22,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:22,823 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:22,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:22,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:22,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:22,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:22,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:22,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:22,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:22,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:22,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:22,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:22,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:08:22,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,990 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,055 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:08:23,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,089 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:08:23,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:08:23,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:08:23,176 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,190 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,206 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,221 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,251 INFO L267 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-01-18 18:08:23,252 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 18:08:23,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:08:23,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:23,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 18:08:23,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:08:23,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:23,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-18 18:08:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:23,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:23,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:23,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:23,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:23,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:23,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:23,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:23,438 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-18 18:08:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:23,806 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-18 18:08:23,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:23,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:23,810 INFO L225 Difference]: With dead ends: 54 [2019-01-18 18:08:23,810 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 18:08:23,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 18:08:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-18 18:08:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 18:08:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-18 18:08:23,830 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-18 18:08:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:23,831 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-18 18:08:23,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-18 18:08:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:23,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:23,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:23,832 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-18 18:08:23,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:23,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:23,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:23,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:23,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:23,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:23,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:23,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:23,939 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-18 18:08:23,940 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:23,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:24,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:24,198 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:24,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:24,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:24,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:24,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:24,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:24,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:24,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,269 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:24,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,298 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:24,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:24,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:24,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:24,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:24,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:24,396 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:24,397 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,415 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,429 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,442 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,453 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,477 INFO L267 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-01-18 18:08:24,477 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:24,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:08:24,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:24,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 18:08:24,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:24,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 18:08:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:24,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:24,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:24,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:24,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:24,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:24,667 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-18 18:08:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:24,958 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-18 18:08:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:24,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:24,959 INFO L225 Difference]: With dead ends: 63 [2019-01-18 18:08:24,960 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 18:08:24,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 18:08:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-18 18:08:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 18:08:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-18 18:08:24,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-18 18:08:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:24,971 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-18 18:08:24,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-18 18:08:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:24,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:24,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:24,972 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-18 18:08:24,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:24,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:24,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:08:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:25,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 18:08:25,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:25,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:08:25,036 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-18 18:08:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:25,095 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-18 18:08:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:25,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 18:08:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:25,096 INFO L225 Difference]: With dead ends: 41 [2019-01-18 18:08:25,096 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 18:08:25,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:08:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 18:08:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-18 18:08:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 18:08:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-18 18:08:25,104 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-18 18:08:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:25,105 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-18 18:08:25,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-18 18:08:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:25,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:25,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:25,105 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-18 18:08:25,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:25,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:25,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:25,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:25,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:25,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:25,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:25,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:25,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:25,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:25,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:25,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:25,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:08:25,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:25,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:25,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:25,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:25,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:25,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:25,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:08:25,257 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,347 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:08:25,716 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-18 18:08:25,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,777 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:08:26,128 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-18 18:08:26,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:08:26,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:08:26,183 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,199 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,215 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,259 INFO L267 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-01-18 18:08:26,260 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 18:08:26,496 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-18 18:08:26,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:08:26,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:26,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 18:08:26,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:26,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-18 18:08:26,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:26,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-18 18:08:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:26,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:26,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:26,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:26,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:26,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:26,851 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-18 18:08:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:27,229 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-18 18:08:27,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:27,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:27,230 INFO L225 Difference]: With dead ends: 57 [2019-01-18 18:08:27,231 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 18:08:27,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 18:08:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-18 18:08:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 18:08:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-18 18:08:27,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-18 18:08:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:27,242 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-18 18:08:27,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-18 18:08:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:27,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:27,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:27,243 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-18 18:08:27,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:27,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:27,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:27,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:27,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:27,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:27,305 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:27,306 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-18 18:08:27,306 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:27,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:27,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:27,525 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:27,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:27,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:27,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:27,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:27,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:27,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:27,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,573 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:27,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,611 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:27,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:27,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,659 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:27,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:27,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:27,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:27,698 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:27,699 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,728 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,768 INFO L267 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-01-18 18:08:27,769 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:27,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:08:27,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:27,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:27,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 18:08:27,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:27,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:27,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:27,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:27,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:27,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:27,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:27,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:27,918 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-18 18:08:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:28,213 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-18 18:08:28,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:28,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:28,214 INFO L225 Difference]: With dead ends: 61 [2019-01-18 18:08:28,214 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 18:08:28,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 18:08:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-18 18:08:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 18:08:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-18 18:08:28,226 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-18 18:08:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:28,227 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-18 18:08:28,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-18 18:08:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:28,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:28,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:28,228 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-18 18:08:28,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:28,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:28,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:28,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:28,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:28,265 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:28,265 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-18 18:08:28,266 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:28,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:28,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:28,441 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:28,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:28,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:28,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:28,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:28,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:28,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:28,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:28,494 INFO L478 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 21 treesize of output 23 [2019-01-18 18:08:28,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,504 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:08:28,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,524 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:08:28,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:08:28,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:08:28,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,638 INFO L478 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 36 treesize of output 49 [2019-01-18 18:08:28,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,672 INFO L478 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 32 treesize of output 57 [2019-01-18 18:08:28,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:08:28,720 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,733 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,764 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,865 INFO L267 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-01-18 18:08:28,865 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 18:08:28,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:08:28,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:28,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-18 18:08:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:28,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:29,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:29,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:08:29,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:29,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:08:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:08:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:29,006 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-18 18:08:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:29,153 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-18 18:08:29,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:29,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 18:08:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:29,155 INFO L225 Difference]: With dead ends: 53 [2019-01-18 18:08:29,155 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 18:08:29,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:08:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 18:08:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-18 18:08:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 18:08:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-18 18:08:29,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-18 18:08:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:29,170 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-18 18:08:29,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:08:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-18 18:08:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:29,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:29,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:29,171 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-18 18:08:29,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:29,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:29,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:29,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:29,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:29,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:29,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:29,395 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:29,395 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-18 18:08:29,396 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:29,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:29,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:29,646 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:29,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:29,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:29,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:29,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:29,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:29,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:29,811 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-18 18:08:29,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:29,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:29,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:29,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:29,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:08:29,837 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,964 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:08:29,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,997 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:08:30,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:08:30,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:08:30,105 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,121 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,152 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,220 INFO L267 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-01-18 18:08:30,220 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 18:08:30,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:08:30,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:30,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 18:08:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:08:30,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:30,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-18 18:08:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:30,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:30,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:30,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:30,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:30,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:30,518 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-18 18:08:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:30,853 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-18 18:08:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:30,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:30,854 INFO L225 Difference]: With dead ends: 69 [2019-01-18 18:08:30,855 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 18:08:30,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 18:08:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-18 18:08:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 18:08:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-18 18:08:30,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-18 18:08:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:30,865 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-18 18:08:30,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-18 18:08:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:30,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:30,866 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 18:08:30,867 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-18 18:08:30,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:30,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:30,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:30,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:30,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:08:30,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:30,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:30,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:30,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:30,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:30,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:30,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:30,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:30,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:30,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:30,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:31,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:31,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:31,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:31,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:31,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:08:31,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,326 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:08:31,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,361 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:08:31,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:08:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:08:31,479 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,497 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,512 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,530 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,563 INFO L267 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-01-18 18:08:31,563 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-18 18:08:31,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:08:31,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:31,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 18:08:31,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-18 18:08:31,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:31,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-18 18:08:31,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 18:08:31,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:31,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-18 18:08:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:31,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:31,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:31,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-18 18:08:31,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:31,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:08:31,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:08:31,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:08:31,802 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-18 18:08:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:32,159 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-18 18:08:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:32,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 18:08:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:32,161 INFO L225 Difference]: With dead ends: 73 [2019-01-18 18:08:32,162 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 18:08:32,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 18:08:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-18 18:08:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 18:08:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-18 18:08:32,173 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-18 18:08:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:32,173 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-18 18:08:32,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:08:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-18 18:08:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:32,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:32,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:32,175 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-18 18:08:32,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:32,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:32,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:32,465 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-18 18:08:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:32,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:32,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:32,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:32,486 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-18 18:08:32,487 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:32,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:32,735 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:32,735 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:32,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:32,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:32,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:32,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:32,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:32,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:32,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:32,761 INFO L478 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 21 treesize of output 23 [2019-01-18 18:08:32,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,771 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:08:32,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,782 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:08:32,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:08:32,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:08:32,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,900 INFO L478 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 36 treesize of output 49 [2019-01-18 18:08:32,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,934 INFO L478 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 32 treesize of output 57 [2019-01-18 18:08:32,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:08:32,978 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,991 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:33,005 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:33,020 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:33,047 INFO L267 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-01-18 18:08:33,047 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:08:33,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 18:08:33,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:33,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:33,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:08:33,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-18 18:08:33,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:33,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:33,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-18 18:08:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:33,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:33,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:33,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:33,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:33,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:33,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:33,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:33,295 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-18 18:08:33,709 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-18 18:08:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:33,908 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-18 18:08:33,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:33,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:33,910 INFO L225 Difference]: With dead ends: 84 [2019-01-18 18:08:33,910 INFO L226 Difference]: Without dead ends: 78 [2019-01-18 18:08:33,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:08:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-18 18:08:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-18 18:08:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 18:08:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-18 18:08:33,926 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-18 18:08:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:33,926 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-18 18:08:33,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-18 18:08:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:33,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:33,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:33,927 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-18 18:08:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:33,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:34,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:34,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:34,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:34,073 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-18 18:08:34,074 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:34,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:34,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:34,496 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:34,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:34,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:34,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:34,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:34,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:34,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:34,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:34,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:34,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:34,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:34,569 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:34,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,599 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,654 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:34,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,682 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:34,714 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,724 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,732 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,752 INFO L267 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-01-18 18:08:34,753 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:34,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-18 18:08:34,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:08:34,863 INFO L267 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-01-18 18:08:34,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-18 18:08:35,383 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-18 18:08:35,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,705 INFO L303 Elim1Store]: Index analysis took 316 ms [2019-01-18 18:08:36,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 18:08:36,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-18 18:08:36,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,842 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:36,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-18 18:08:36,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-18 18:08:36,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-18 18:08:37,083 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-18 18:08:37,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,099 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:37,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-01-18 18:08:37,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-01-18 18:08:37,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,277 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:37,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-18 18:08:37,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,409 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:37,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-18 18:08:37,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,498 INFO L267 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-01-18 18:08:37,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-18 18:08:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:37,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:37,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:37,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:08:37,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:37,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:37,746 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-18 18:08:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:38,678 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-18 18:08:38,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:08:38,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:38,682 INFO L225 Difference]: With dead ends: 109 [2019-01-18 18:08:38,682 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 18:08:38,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:08:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 18:08:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-18 18:08:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 18:08:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-18 18:08:38,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-18 18:08:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:38,696 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-18 18:08:38,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-18 18:08:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:38,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:38,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:38,697 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-18 18:08:38,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:38,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:38,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:38,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:08:38,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:38,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:38,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:38,762 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-18 18:08:38,762 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:38,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:38,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:38,994 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:38,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:38,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:38,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:38,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:39,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:39,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:39,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:39,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:39,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:39,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:39,079 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:39,080 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,101 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,157 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:39,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,183 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:39,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:39,216 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,255 INFO L267 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-01-18 18:08:39,255 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:39,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:08:39,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:39,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:39,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:08:39,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:39,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:39,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:39,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:39,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:39,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:39,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:39,621 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-18 18:08:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:39,979 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-18 18:08:39,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:39,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:39,981 INFO L225 Difference]: With dead ends: 77 [2019-01-18 18:08:39,981 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 18:08:39,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 18:08:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-18 18:08:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 18:08:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-18 18:08:39,996 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-18 18:08:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:39,997 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-18 18:08:39,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-18 18:08:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:39,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:39,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:39,997 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-18 18:08:39,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:39,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:39,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:39,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:39,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:40,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:40,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:40,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:40,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:40,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:40,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:40,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:40,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:40,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:40,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:40,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:40,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,161 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:08:40,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,194 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:08:40,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:08:40,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:08:40,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:40,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:40,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:40,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:40,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:08:40,359 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,382 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,395 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,406 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,416 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,445 INFO L267 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-01-18 18:08:40,445 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:08:40,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:08:40,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:40,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:08:40,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,532 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:40,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-18 18:08:40,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:40,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-18 18:08:40,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-18 18:08:40,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:40,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-18 18:08:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:40,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:40,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:40,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:40,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:40,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:40,737 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-18 18:08:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:41,247 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-18 18:08:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:41,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:41,253 INFO L225 Difference]: With dead ends: 88 [2019-01-18 18:08:41,253 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 18:08:41,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:08:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 18:08:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-18 18:08:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 18:08:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-18 18:08:41,274 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-18 18:08:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:41,274 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-18 18:08:41,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-18 18:08:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:41,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:41,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:41,275 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:41,276 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-18 18:08:41,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:41,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:41,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:41,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:41,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:41,340 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:41,340 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-18 18:08:41,341 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:41,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:41,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:41,567 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:41,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:41,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:41,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:41,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:41,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:41,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:41,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:41,597 INFO L478 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 21 treesize of output 23 [2019-01-18 18:08:41,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,608 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:08:41,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,622 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:08:41,639 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:08:41,640 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,659 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:08:41,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,720 INFO L478 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 22 treesize of output 38 [2019-01-18 18:08:41,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:08:41,749 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,758 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,767 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,785 INFO L267 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-01-18 18:08:41,786 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 18:08:41,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,815 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 18:08:41,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,824 INFO L267 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-01-18 18:08:41,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:08:41,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,842 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 18:08:41,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:41,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-18 18:08:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:41,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:41,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:41,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:41,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:41,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:41,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:41,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:41,912 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-18 18:08:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:42,178 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-18 18:08:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:42,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:42,180 INFO L225 Difference]: With dead ends: 81 [2019-01-18 18:08:42,180 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 18:08:42,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 18:08:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-18 18:08:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 18:08:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-18 18:08:42,194 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-18 18:08:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:42,194 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-18 18:08:42,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-18 18:08:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:42,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:42,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:42,195 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:42,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:42,196 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-18 18:08:42,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:42,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:42,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:42,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:42,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:42,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:42,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:42,336 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-18 18:08:42,337 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:42,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:42,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:42,819 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:42,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:42,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:42,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:42,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:42,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:42,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:42,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,901 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:42,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,926 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:42,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:42,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:42,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:42,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:42,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:43,005 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:43,006 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,021 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,035 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,045 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,053 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,073 INFO L267 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-01-18 18:08:43,074 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:43,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:08:43,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,157 INFO L267 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-01-18 18:08:43,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:43,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 18:08:43,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:43,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:43,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,234 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:43,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:43,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-18 18:08:43,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:43,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:43,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:43,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:43,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:43,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:43,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:43,345 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-18 18:08:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:43,806 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-18 18:08:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:43,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:43,808 INFO L225 Difference]: With dead ends: 113 [2019-01-18 18:08:43,808 INFO L226 Difference]: Without dead ends: 112 [2019-01-18 18:08:43,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-18 18:08:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-18 18:08:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 18:08:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-18 18:08:43,827 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-18 18:08:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:43,827 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-18 18:08:43,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-18 18:08:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:43,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:43,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:43,828 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:43,828 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-18 18:08:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:43,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:43,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:43,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:43,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:43,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:43,921 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-18 18:08:43,923 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:43,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:44,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:44,275 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:44,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:44,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:44,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:44,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:44,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:44,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:44,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:44,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:44,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:44,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:44,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:44,378 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:44,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,399 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,458 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:44,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,497 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:44,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:44,536 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,545 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,575 INFO L267 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-01-18 18:08:44,575 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:44,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:08:44,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 18:08:44,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-18 18:08:44,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-18 18:08:44,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2019-01-18 18:08:44,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:44,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-18 18:08:44,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:45,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 73 [2019-01-18 18:08:45,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:45,117 INFO L267 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-01-18 18:08:45,118 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:138, output treesize:96 [2019-01-18 18:08:45,404 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-18 18:08:45,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,460 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:45,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 18:08:45,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:45,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-18 18:08:45,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:45,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:45,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-18 18:08:45,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:45,654 INFO L267 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-01-18 18:08:45,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-18 18:08:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:45,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:45,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:45,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-18 18:08:45,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:45,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:45,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:45,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:08:45,739 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-18 18:08:46,083 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 26 [2019-01-18 18:08:50,233 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-01-18 18:08:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:50,699 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-18 18:08:50,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:08:50,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:50,701 INFO L225 Difference]: With dead ends: 137 [2019-01-18 18:08:50,701 INFO L226 Difference]: Without dead ends: 136 [2019-01-18 18:08:50,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-18 18:08:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-18 18:08:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 18:08:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-18 18:08:50,730 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-18 18:08:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:50,730 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-18 18:08:50,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-18 18:08:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:50,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:50,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:50,732 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-18 18:08:50,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:50,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:50,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:50,964 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-18 18:08:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:08:50,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:50,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:50,981 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:50,981 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-18 18:08:50,982 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:50,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:51,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:51,680 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:51,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:51,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:51,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:51,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:51,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:51,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:51,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,730 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:08:51,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,771 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:08:51,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:08:51,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:08:51,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:51,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:51,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:51,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:51,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:08:51,937 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,959 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,973 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,026 INFO L267 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-01-18 18:08:52,027 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 18:08:52,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:08:52,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:52,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 18:08:52,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:52,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:08:52,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:52,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-18 18:08:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:52,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:52,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:52,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:52,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:52,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:52,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:52,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:52,263 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-18 18:08:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:52,588 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-18 18:08:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:52,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:52,590 INFO L225 Difference]: With dead ends: 120 [2019-01-18 18:08:52,590 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 18:08:52,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 18:08:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-18 18:08:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 18:08:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-18 18:08:52,627 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-18 18:08:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:52,627 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-18 18:08:52,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-18 18:08:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:52,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:52,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:52,628 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-18 18:08:52,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:52,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:52,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:52,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:52,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:52,680 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-18 18:08:52,681 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:52,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:53,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:53,983 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:53,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:53,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:53,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:53,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:53,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:53,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:54,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:54,005 INFO L478 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 21 treesize of output 23 [2019-01-18 18:08:54,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,014 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:08:54,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,029 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:08:54,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:08:54,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:08:54,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,145 INFO L478 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 36 treesize of output 49 [2019-01-18 18:08:54,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,181 INFO L478 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 32 treesize of output 57 [2019-01-18 18:08:54,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:08:54,228 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,240 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,255 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,270 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,298 INFO L267 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-01-18 18:08:54,298 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 18:08:54,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:08:54,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:54,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-18 18:08:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:54,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:54,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:08:54,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 18:08:54,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:54,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-18 18:08:54,513 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-18 18:08:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:54,655 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-18 18:08:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:54,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 18:08:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:54,657 INFO L225 Difference]: With dead ends: 105 [2019-01-18 18:08:54,657 INFO L226 Difference]: Without dead ends: 104 [2019-01-18 18:08:54,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-18 18:08:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-18 18:08:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-18 18:08:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 18:08:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-18 18:08:54,704 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-18 18:08:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:54,704 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-18 18:08:54,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-18 18:08:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:54,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:54,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:54,705 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:54,705 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-18 18:08:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:54,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:54,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:54,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:55,269 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-18 18:08:55,699 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-18 18:08:55,895 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 18:08:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:56,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:56,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:56,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:56,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:56,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:56,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:56,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:08:56,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:08:56,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:08:56,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:56,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:56,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:56,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:08:56,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:08:56,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:08:56,197 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:08:56,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,350 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:56,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,377 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:08:56,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:56,408 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,418 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,427 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,448 INFO L267 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-01-18 18:08:56,448 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 18:08:56,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:08:56,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 18:08:56,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-18 18:08:56,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:199 [2019-01-18 18:08:56,803 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-01-18 18:08:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-18 18:08:56,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:56,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-18 18:08:56,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 18:08:56,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 18:08:57,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-18 18:08:57,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:181, output treesize:121 [2019-01-18 18:08:57,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,229 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:57,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-18 18:08:57,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-01-18 18:08:57,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,404 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:57,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-18 18:08:57,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,492 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:57,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-18 18:08:57,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,559 INFO L267 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-01-18 18:08:57,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-18 18:08:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:57,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:57,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:57,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:57,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:57,703 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-18 18:08:58,155 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-18 18:08:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:58,475 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-18 18:08:58,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:58,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:58,479 INFO L225 Difference]: With dead ends: 131 [2019-01-18 18:08:58,479 INFO L226 Difference]: Without dead ends: 130 [2019-01-18 18:08:58,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:08:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-18 18:08:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-18 18:08:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 18:08:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-18 18:08:58,505 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-18 18:08:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:58,505 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-18 18:08:58,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-18 18:08:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:58,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:58,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:58,506 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-18 18:08:58,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:58,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:58,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:58,730 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-18 18:08:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:58,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:58,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:58,745 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:58,746 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-18 18:08:58,747 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:58,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:59,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:59,249 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:59,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:59,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:59,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:59,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:08:59,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:59,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:59,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:59,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:08:59,271 INFO L478 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 21 treesize of output 23 [2019-01-18 18:08:59,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,278 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:08:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,291 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:08:59,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:08:59,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,346 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:08:59,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,413 INFO L478 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 36 treesize of output 49 [2019-01-18 18:08:59,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,448 INFO L478 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 32 treesize of output 57 [2019-01-18 18:08:59,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:08:59,491 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,504 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,518 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,533 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,559 INFO L267 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-01-18 18:08:59,559 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:08:59,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:08:59,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:59,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:08:59,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,686 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:59,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-01-18 18:08:59,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:59,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-18 18:08:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:59,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:59,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:59,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:59,781 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-18 18:09:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:00,277 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-18 18:09:00,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:00,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:09:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:00,279 INFO L225 Difference]: With dead ends: 71 [2019-01-18 18:09:00,279 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 18:09:00,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 18:09:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-18 18:09:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 18:09:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-18 18:09:00,309 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-18 18:09:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:00,309 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-18 18:09:00,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-18 18:09:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:09:00,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:00,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:09:00,310 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:00,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-18 18:09:00,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:00,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:00,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:00,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:00,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:00,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:00,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:00,435 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:09:00,435 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-18 18:09:00,436 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:00,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:00,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:00,637 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:00,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:00,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:00,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:09:00,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:00,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:00,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:00,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,672 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:09:00,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,715 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:09:00,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:09:00,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:00,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:00,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:00,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:00,803 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:09:00,803 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,843 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,852 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,872 INFO L267 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-01-18 18:09:00,872 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-18 18:09:00,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:09:00,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:00,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:00,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 18:09:00,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:00,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 18:09:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:00,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:01,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:01,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:09:01,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:01,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:01,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:01,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:09:01,002 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-18 18:09:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:01,269 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-18 18:09:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:09:01,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:09:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:01,270 INFO L225 Difference]: With dead ends: 73 [2019-01-18 18:09:01,271 INFO L226 Difference]: Without dead ends: 72 [2019-01-18 18:09:01,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-18 18:09:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-18 18:09:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 18:09:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-18 18:09:01,296 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-18 18:09:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:01,297 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-18 18:09:01,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-18 18:09:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:09:01,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:01,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:09:01,297 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:01,298 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-18 18:09:01,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:01,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:01,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:01,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:01,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:01,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:09:01,392 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-18 18:09:01,396 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:01,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:01,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:01,608 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:01,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:01,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:01,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:09:01,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:01,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:01,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:01,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:01,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:01,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:01,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:01,683 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:09:01,683 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,763 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:09:01,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,792 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:09:01,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:09:01,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,836 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,866 INFO L267 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-01-18 18:09:01,866 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:09:01,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:09:01,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:01,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:01,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:01,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:01,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 18:09:01,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:01,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:01,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-18 18:09:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:02,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-18 18:09:02,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:02,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:09:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:09:02,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:02,042 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-18 18:09:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:02,285 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-18 18:09:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:09:02,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 18:09:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:02,286 INFO L225 Difference]: With dead ends: 66 [2019-01-18 18:09:02,286 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 18:09:02,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 18:09:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-18 18:09:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 18:09:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-18 18:09:02,322 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-18 18:09:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:02,322 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-18 18:09:02,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:09:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-18 18:09:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:09:02,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:02,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:09:02,323 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-18 18:09:02,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:02,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:09:02,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 18:09:02,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:02,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:09:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:09:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:09:02,399 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-18 18:09:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:02,466 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-18 18:09:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:09:02,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 18:09:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:02,468 INFO L225 Difference]: With dead ends: 54 [2019-01-18 18:09:02,468 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 18:09:02,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:09:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 18:09:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-18 18:09:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 18:09:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-18 18:09:02,498 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-18 18:09:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:02,498 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-18 18:09:02,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:09:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-18 18:09:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:09:02,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:02,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:09:02,499 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-18 18:09:02,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:02,731 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-18 18:09:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:02,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:02,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:02,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:09:02,831 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-18 18:09:02,836 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:02,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:03,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:03,041 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:03,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:03,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:03,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:09:03,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:03,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:03,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:03,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:09:03,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,087 INFO L478 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 22 treesize of output 38 [2019-01-18 18:09:03,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:09:03,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:03,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:03,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:03,181 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:03,188 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:09:03,189 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,205 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,217 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,227 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,256 INFO L267 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-01-18 18:09:03,256 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 18:09:03,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,291 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:09:03,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:03,348 INFO L267 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-01-18 18:09:03,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-18 18:09:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:03,379 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 18:09:03,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:03,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:03,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-18 18:09:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:03,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:03,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:03,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:09:03,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:03,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:09:03,482 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-18 18:09:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:03,730 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-18 18:09:03,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:09:03,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:09:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:03,732 INFO L225 Difference]: With dead ends: 83 [2019-01-18 18:09:03,732 INFO L226 Difference]: Without dead ends: 82 [2019-01-18 18:09:03,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-18 18:09:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-18 18:09:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 18:09:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-18 18:09:03,779 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-18 18:09:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:03,779 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-18 18:09:03,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-18 18:09:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:03,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:03,780 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 18:09:03,780 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-18 18:09:03,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:03,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:03,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:03,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:03,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:03,873 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-18 18:09:03,874 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:03,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:04,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:04,034 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:09:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:04,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:04,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:04,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:04,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:04,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:04,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:04,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:09:04,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,080 INFO L478 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 22 treesize of output 38 [2019-01-18 18:09:04,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:09:04,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,136 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:04,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:04,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:04,172 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:04,179 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:09:04,180 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,194 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,205 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,215 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,224 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,242 INFO L267 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-01-18 18:09:04,242 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 18:09:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,269 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 18:09:04,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,278 INFO L267 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-01-18 18:09:04,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:09:04,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,298 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-01-18 18:09:04,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:04,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-18 18:09:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:04,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:04,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:04,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:09:04,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:04,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:04,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:09:04,362 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-18 18:09:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:04,692 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-18 18:09:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:04,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:09:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:04,693 INFO L225 Difference]: With dead ends: 86 [2019-01-18 18:09:04,694 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 18:09:04,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 18:09:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-18 18:09:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 18:09:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-18 18:09:04,751 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-18 18:09:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:04,751 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-18 18:09:04,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-18 18:09:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:04,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:04,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:04,752 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-18 18:09:04,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:04,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:04,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:04,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:04,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:04,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:04,874 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-18 18:09:04,875 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:04,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:05,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:05,184 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:05,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:05,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:05,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:05,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:05,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:05,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:05,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,228 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:09:05,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,271 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:09:05,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:09:05,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:09:05,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,390 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:05,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:05,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:05,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:05,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:09:05,440 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,477 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,487 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,497 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,526 INFO L267 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-01-18 18:09:05,526 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:09:05,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:09:05,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:05,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:09:05,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 18:09:05,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:05,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-18 18:09:05,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:05,697 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:05,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 18:09:05,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:05,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:05,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-18 18:09:05,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-01-18 18:09:05,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:05,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:05,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:09:05,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:05,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:05,906 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-18 18:09:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:06,436 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-18 18:09:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:06,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:09:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:06,437 INFO L225 Difference]: With dead ends: 100 [2019-01-18 18:09:06,437 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 18:09:06,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 18:09:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-18 18:09:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 18:09:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-18 18:09:06,527 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-18 18:09:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:06,527 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-18 18:09:06,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-18 18:09:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:06,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:06,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:06,528 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-18 18:09:06,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:06,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:06,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:06,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:06,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:06,719 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:06,719 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-18 18:09:06,719 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:06,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:07,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:07,002 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:07,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:07,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:07,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:07,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:07,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:07,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:07,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:09:07,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,098 INFO L478 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 36 treesize of output 49 [2019-01-18 18:09:07,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,136 INFO L478 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 32 treesize of output 57 [2019-01-18 18:09:07,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:09:07,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:07,281 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:07,283 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:07,287 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:07,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:09:07,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,311 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,323 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,343 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,370 INFO L267 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-01-18 18:09:07,370 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:09:07,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:09:07,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,430 INFO L267 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-01-18 18:09:07,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:09:07,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:07,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:09:07,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:07,507 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:07,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 18:09:07,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:07,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:07,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:09:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:07,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:07,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:07,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:09:07,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:07,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:07,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:07,605 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-18 18:09:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:08,082 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-18 18:09:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:08,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:09:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:08,084 INFO L225 Difference]: With dead ends: 104 [2019-01-18 18:09:08,084 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 18:09:08,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 18:09:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-18 18:09:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 18:09:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-18 18:09:08,185 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-18 18:09:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:08,185 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-18 18:09:08,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-18 18:09:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:08,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:08,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:08,186 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:08,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:08,187 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-18 18:09:08,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:08,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:08,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:08,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:08,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:08,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:08,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:08,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:08,370 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-18 18:09:08,371 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:08,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:08,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:08,691 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:08,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:08,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:08,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:08,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:08,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:08,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,731 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:09:08,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,771 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:09:08,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:09:08,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:08,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:08,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:08,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:08,851 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:09:08,852 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,869 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,883 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,894 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,923 INFO L267 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-01-18 18:09:08,924 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 18:09:08,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:08,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:09:08,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:08,983 INFO L267 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-01-18 18:09:08,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:09,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:09:09,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:09,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:09,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:09:09,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:09,060 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:09,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 18:09:09,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:09,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:09,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:09:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:09,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:09,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:09,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:09:09,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:09,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:09,154 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-18 18:09:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:09,716 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-18 18:09:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:09,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:09:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:09,718 INFO L225 Difference]: With dead ends: 107 [2019-01-18 18:09:09,719 INFO L226 Difference]: Without dead ends: 106 [2019-01-18 18:09:09,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-18 18:09:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-18 18:09:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 18:09:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-18 18:09:09,828 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-18 18:09:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:09,828 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-18 18:09:09,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-18 18:09:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:09,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:09,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:09,829 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:09,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-18 18:09:09,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:09,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:09,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:09,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:09,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:09,937 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-18 18:09:09,939 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:09,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:10,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:10,160 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:10,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:10,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:10,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:10,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:10,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:10,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:10,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:10,202 INFO L478 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 21 treesize of output 23 [2019-01-18 18:09:10,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,215 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,225 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:09:10,233 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:09:10,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,330 INFO L478 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 36 treesize of output 49 [2019-01-18 18:09:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,366 INFO L478 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 32 treesize of output 57 [2019-01-18 18:09:10,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:09:10,413 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,426 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,441 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,456 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,482 INFO L267 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-01-18 18:09:10,483 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:09:10,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:09:10,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:10,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:10,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 18:09:10,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:10,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:10,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 18:09:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:10,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:10,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:10,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:09:10,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:10,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:10,661 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-18 18:09:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:11,044 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-18 18:09:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:09:11,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:09:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:11,046 INFO L225 Difference]: With dead ends: 100 [2019-01-18 18:09:11,046 INFO L226 Difference]: Without dead ends: 98 [2019-01-18 18:09:11,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-18 18:09:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-18 18:09:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 18:09:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-18 18:09:11,157 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-18 18:09:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:11,157 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-18 18:09:11,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-18 18:09:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:11,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:11,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:11,158 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-18 18:09:11,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:11,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:11,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:11,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:11,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:11,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:11,259 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-18 18:09:11,260 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:11,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:11,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:11,915 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:11,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:11,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:11,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:11,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:11,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:11,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:11,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,953 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:09:11,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,997 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:09:12,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:09:12,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:12,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:12,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:12,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:12,082 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:09:12,083 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,098 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,111 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,151 INFO L267 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-01-18 18:09:12,152 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:09:12,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:09:12,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 18:09:12,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-18 18:09:12,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-18 18:09:12,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2019-01-18 18:09:12,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,532 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:12,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 18:09:12,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,603 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:12,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-18 18:09:12,604 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,655 INFO L267 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-01-18 18:09:12,656 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:142, output treesize:92 [2019-01-18 18:09:12,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 18:09:12,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2019-01-18 18:09:12,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,839 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:12,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-18 18:09:12,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,884 INFO L267 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-01-18 18:09:12,884 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-18 18:09:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:12,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:13,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:13,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:09:13,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:13,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:13,077 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-18 18:09:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:14,121 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-18 18:09:14,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:09:14,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:09:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:14,123 INFO L225 Difference]: With dead ends: 124 [2019-01-18 18:09:14,124 INFO L226 Difference]: Without dead ends: 123 [2019-01-18 18:09:14,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:09:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-18 18:09:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-18 18:09:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 18:09:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-18 18:09:14,247 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-18 18:09:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:14,247 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-18 18:09:14,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-18 18:09:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:14,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:14,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:14,248 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-18 18:09:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:14,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:14,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:14,397 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 18:09:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:14,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:14,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:14,525 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:14,525 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-18 18:09:14,527 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:14,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:15,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:15,220 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:15,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:15,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:15,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:15,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:15,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:15,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:15,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:15,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:15,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:15,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:15,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:09:15,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,329 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,393 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:09:15,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,424 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:09:15,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:09:15,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:09:15,510 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,526 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,541 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,556 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,585 INFO L267 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-01-18 18:09:15,585 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:09:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:09:15,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:15,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:09:15,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,672 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:15,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:09:15,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:15,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-18 18:09:15,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:15,734 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:15,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:09:15,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:15,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:15,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 18:09:15,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-01-18 18:09:15,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:15,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:15,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 18:09:15,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:15,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:09:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:09:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:15,844 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-18 18:09:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:16,398 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-18 18:09:16,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:16,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 18:09:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:16,400 INFO L225 Difference]: With dead ends: 114 [2019-01-18 18:09:16,400 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 18:09:16,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:09:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 18:09:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-18 18:09:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 18:09:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-18 18:09:16,523 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-18 18:09:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:16,524 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-18 18:09:16,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:09:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-18 18:09:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:16,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:16,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:16,524 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-18 18:09:16,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:16,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:16,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:16,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:16,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:16,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:16,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:16,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:16,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:16,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:16,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:16,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:09:16,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:09:16,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:09:16,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:16,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:16,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:16,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:16,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:16,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:16,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:09:16,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,712 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,774 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:09:16,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,807 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:09:16,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:09:16,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:09:16,892 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,908 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,923 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,939 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:16,968 INFO L267 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-01-18 18:09:16,968 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-18 18:09:16,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:16,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:09:16,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:17,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:17,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-18 18:09:17,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:09:17,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:17,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:17,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-18 18:09:17,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:17,111 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:17,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 18:09:17,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:17,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:17,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-18 18:09:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:17,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:17,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:17,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:09:17,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:17,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:17,535 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-18 18:09:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:18,110 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-18 18:09:18,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:09:18,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:09:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:18,112 INFO L225 Difference]: With dead ends: 164 [2019-01-18 18:09:18,112 INFO L226 Difference]: Without dead ends: 163 [2019-01-18 18:09:18,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-18 18:09:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-18 18:09:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-18 18:09:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-18 18:09:18,310 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-18 18:09:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:18,310 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-18 18:09:18,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-18 18:09:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:18,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:18,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:18,311 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-18 18:09:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:18,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:09:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:18,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:18,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:18,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:18,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:18,434 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-18 18:09:18,434 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:18,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:18,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:18,960 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:18,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:18,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:18,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:18,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:18,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:18,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:18,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:09:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,011 INFO L478 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 36 treesize of output 49 [2019-01-18 18:09:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,055 INFO L478 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 32 treesize of output 57 [2019-01-18 18:09:19,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:09:19,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:19,166 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:19,169 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:19,173 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:19,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:09:19,177 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,199 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,211 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,221 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,231 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,258 INFO L267 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-01-18 18:09:19,258 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:09:19,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:09:19,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:19,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:19,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:09:19,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:19,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:09:19,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:19,443 INFO L267 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-01-18 18:09:19,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 18:09:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:19,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:19,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:19,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:09:19,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:19,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:19,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:19,515 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-18 18:09:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:20,009 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-18 18:09:20,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:09:20,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:09:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:20,012 INFO L225 Difference]: With dead ends: 160 [2019-01-18 18:09:20,012 INFO L226 Difference]: Without dead ends: 159 [2019-01-18 18:09:20,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-18 18:09:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-18 18:09:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-18 18:09:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-18 18:09:20,443 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-18 18:09:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:20,443 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-18 18:09:20,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-18 18:09:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:20,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:20,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:20,444 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:20,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-18 18:09:20,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:20,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:20,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:20,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:20,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:20,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:20,548 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-18 18:09:20,549 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:20,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:20,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:20,871 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:20,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:20,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:20,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:20,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:20,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:20,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:20,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:20,915 INFO L478 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 21 treesize of output 23 [2019-01-18 18:09:20,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:20,926 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:20,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:20,949 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:20,958 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:09:20,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:20,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:20,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:20,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:21,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:21,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:09:21,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,041 INFO L478 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 22 treesize of output 38 [2019-01-18 18:09:21,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:09:21,070 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:21,078 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:21,087 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:21,106 INFO L267 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-01-18 18:09:21,106 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 18:09:21,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,138 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 18:09:21,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:21,149 INFO L267 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-01-18 18:09:21,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:09:21,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:21,167 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 18:09:21,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:21,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:21,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-18 18:09:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:21,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:21,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:21,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:09:21,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:21,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:09:21,231 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-18 18:09:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:21,752 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-18 18:09:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:21,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:09:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:21,754 INFO L225 Difference]: With dead ends: 175 [2019-01-18 18:09:21,754 INFO L226 Difference]: Without dead ends: 174 [2019-01-18 18:09:21,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-18 18:09:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-18 18:09:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 18:09:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-18 18:09:21,982 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-18 18:09:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:21,983 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-18 18:09:21,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-18 18:09:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:21,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:21,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:21,984 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-18 18:09:21,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:21,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:22,121 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 18:09:22,438 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-18 18:09:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:09:22,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:09:22,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 18:09:22,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:22,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:09:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:09:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 18:09:22,574 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-18 18:09:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:22,930 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-18 18:09:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:09:22,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-18 18:09:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:22,932 INFO L225 Difference]: With dead ends: 185 [2019-01-18 18:09:22,932 INFO L226 Difference]: Without dead ends: 184 [2019-01-18 18:09:22,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-18 18:09:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-18 18:09:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-18 18:09:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 18:09:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-18 18:09:23,165 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-18 18:09:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:23,165 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-18 18:09:23,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:09:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-18 18:09:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:23,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:23,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:23,166 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-18 18:09:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:23,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:23,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:23,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:23,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:23,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:23,234 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-18 18:09:23,235 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:23,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:23,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:23,443 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:23,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:23,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:23,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:23,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:23,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:23,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:09:23,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,479 INFO L478 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 22 treesize of output 38 [2019-01-18 18:09:23,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:09:23,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:23,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:23,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:23,588 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:23,603 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:09:23,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,648 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,673 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,695 INFO L267 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-01-18 18:09:23,696 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 18:09:23,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,733 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 18:09:23,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,744 INFO L267 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-01-18 18:09:23,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:09:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:23,763 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:23,764 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-18 18:09:23,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:23,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:23,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 18:09:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:23,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:23,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:23,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:09:23,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:23,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:23,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:23,829 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-18 18:09:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:24,324 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-18 18:09:24,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:09:24,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:09:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:24,327 INFO L225 Difference]: With dead ends: 142 [2019-01-18 18:09:24,327 INFO L226 Difference]: Without dead ends: 141 [2019-01-18 18:09:24,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-18 18:09:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-18 18:09:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-18 18:09:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-18 18:09:24,578 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-18 18:09:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:24,579 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-18 18:09:24,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-18 18:09:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:24,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:24,579 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 18:09:24,579 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-18 18:09:24,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:24,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:24,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:24,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:24,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:24,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:24,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:24,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:24,659 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-18 18:09:24,659 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:24,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:25,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:25,173 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:25,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:25,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:25,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:25,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:25,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:25,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:25,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:25,199 INFO L478 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 21 treesize of output 23 [2019-01-18 18:09:25,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,209 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:25,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,221 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:25,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:09:25,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:09:25,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,342 INFO L478 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 36 treesize of output 49 [2019-01-18 18:09:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,378 INFO L478 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 32 treesize of output 57 [2019-01-18 18:09:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:09:25,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,448 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,463 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,490 INFO L267 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-01-18 18:09:25,491 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 18:09:25,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:09:25,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:25,609 INFO L267 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-01-18 18:09:25,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-18 18:09:25,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:09:25,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:25,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-18 18:09:25,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:25,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-18 18:09:25,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:25,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:25,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:09:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:25,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:25,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:25,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-18 18:09:25,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:25,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:09:25,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:09:25,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:25,791 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-18 18:09:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:26,516 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-18 18:09:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:09:26,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 18:09:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:26,519 INFO L225 Difference]: With dead ends: 219 [2019-01-18 18:09:26,519 INFO L226 Difference]: Without dead ends: 216 [2019-01-18 18:09:26,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-18 18:09:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-18 18:09:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-18 18:09:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-18 18:09:26,802 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-18 18:09:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:26,802 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-18 18:09:26,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:09:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-18 18:09:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:26,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:26,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:26,803 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-18 18:09:26,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:26,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:26,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:26,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:26,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:26,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:26,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:26,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:26,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:26,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:09:26,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:09:26,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:09:26,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:26,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:26,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:26,915 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:09:26,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:26,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:26,941 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:09:26,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:26,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:26,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:26,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:26,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:09:26,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:26,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:26,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:27,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:27,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:27,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:27,021 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:09:27,022 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,039 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,093 INFO L267 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-01-18 18:09:27,094 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-18 18:09:27,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-18 18:09:27,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:27,197 INFO L267 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-01-18 18:09:27,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-18 18:09:27,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 18:09:27,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:27,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-18 18:09:27,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-18 18:09:27,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-18 18:09:27,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,514 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:27,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-18 18:09:27,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-18 18:09:27,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,707 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:27,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-18 18:09:27,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:27,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-18 18:09:27,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:27,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-18 18:09:27,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-18 18:09:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:27,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:28,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:28,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:09:28,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:28,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:28,065 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-18 18:09:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:29,229 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-18 18:09:29,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:09:29,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:09:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:29,232 INFO L225 Difference]: With dead ends: 218 [2019-01-18 18:09:29,232 INFO L226 Difference]: Without dead ends: 215 [2019-01-18 18:09:29,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:09:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-18 18:09:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-18 18:09:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-18 18:09:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-18 18:09:29,560 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-18 18:09:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:29,561 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-18 18:09:29,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-18 18:09:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:29,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:29,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:29,561 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-18 18:09:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:29,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:09:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:29,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:29,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:29,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:29,614 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:29,614 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-18 18:09:29,615 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:29,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:29,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:29,933 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:29,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:29,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:29,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:29,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:29,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:29,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:29,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:09:30,086 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-18 18:09:30,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,091 INFO L478 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 36 treesize of output 49 [2019-01-18 18:09:30,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,125 INFO L478 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 32 treesize of output 57 [2019-01-18 18:09:30,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:09:30,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:30,242 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:30,244 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:30,248 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:30,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:09:30,252 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,532 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,544 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,590 INFO L267 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-01-18 18:09:30,590 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 18:09:30,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:09:30,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:30,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:09:30,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:30,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-18 18:09:30,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:30,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:30,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-18 18:09:30,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-01-18 18:09:30,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:30,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:30,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:09:30,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:30,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:30,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:30,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:09:30,743 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-18 18:09:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:31,564 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-18 18:09:31,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:09:31,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:09:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:31,566 INFO L225 Difference]: With dead ends: 274 [2019-01-18 18:09:31,567 INFO L226 Difference]: Without dead ends: 269 [2019-01-18 18:09:31,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-18 18:09:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-18 18:09:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-18 18:09:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-18 18:09:32,057 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-18 18:09:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:32,057 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-18 18:09:32,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-18 18:09:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:09:32,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:32,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:09:32,058 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:32,058 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-18 18:09:32,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:32,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:32,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:32,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:32,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:09:32,166 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-18 18:09:32,167 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:32,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:33,198 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:33,199 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:33,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:33,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:33,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:33,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:33,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:33,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:33,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:33,293 INFO L478 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 21 treesize of output 23 [2019-01-18 18:09:33,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,314 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:33,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,323 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:33,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:09:33,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:09:33,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,451 INFO L478 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 36 treesize of output 49 [2019-01-18 18:09:33,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,487 INFO L478 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 32 treesize of output 57 [2019-01-18 18:09:33,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:09:33,532 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,546 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,560 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,576 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,608 INFO L267 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-01-18 18:09:33,609 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:09:33,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:09:33,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:33,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:33,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:09:33,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:09:33,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:33,908 INFO L267 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-01-18 18:09:33,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-18 18:09:33,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:33,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:34,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:34,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:34,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:34,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:34,005 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:34,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-18 18:09:34,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:34,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:34,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-18 18:09:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:34,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:34,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:34,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-18 18:09:34,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:34,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:34,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:34,084 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-18 18:09:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:35,609 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-18 18:09:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 18:09:35,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:09:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:35,615 INFO L225 Difference]: With dead ends: 480 [2019-01-18 18:09:35,615 INFO L226 Difference]: Without dead ends: 477 [2019-01-18 18:09:35,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-18 18:09:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-18 18:09:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-18 18:09:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-18 18:09:36,513 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-18 18:09:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:36,513 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-18 18:09:36,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-18 18:09:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:09:36,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:36,515 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 18:09:36,515 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:36,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-18 18:09:36,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:36,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:36,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:36,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:36,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:09:36,556 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-18 18:09:36,557 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:36,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:36,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:36,706 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:09:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:36,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:36,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:36,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:36,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:36,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:36,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:36,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:36,731 INFO L478 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 21 treesize of output 23 [2019-01-18 18:09:36,739 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 18:09:36,753 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 18:09:36,775 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-18 18:09:36,775 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:36,825 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-18 18:09:36,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:36,830 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-18 18:09:36,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-18 18:09:36,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:36,838 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-18 18:09:36,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:36,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-18 18:09:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:36,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:09:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-18 18:09:36,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:36,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:09:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:09:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:09:36,869 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-18 18:09:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:38,764 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-18 18:09:38,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:09:38,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-18 18:09:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:38,771 INFO L225 Difference]: With dead ends: 804 [2019-01-18 18:09:38,771 INFO L226 Difference]: Without dead ends: 800 [2019-01-18 18:09:38,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:09:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-18 18:09:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-18 18:09:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-18 18:09:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-18 18:09:40,759 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-18 18:09:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:40,759 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-18 18:09:40,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:09:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-18 18:09:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:09:40,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:40,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:40,762 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-18 18:09:40,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:40,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:40,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:40,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:40,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:40,917 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-18 18:09:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:40,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:40,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:40,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:09:40,962 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-18 18:09:40,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:40,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:41,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:41,313 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:09:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:41,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:41,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:41,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:41,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:41,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:41,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:41,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:41,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:09:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:09:41,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:09:41,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:09:41,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,518 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:09:41,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,550 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:09:41,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:09:41,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:09:41,637 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,654 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,670 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,685 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,714 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-18 18:09:41,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:09:41,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,777 INFO L267 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-01-18 18:09:41,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-18 18:09:41,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 18:09:41,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:41,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 18:09:41,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:41,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 18:09:41,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:41,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:41,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-18 18:09:41,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:41,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:41,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 18:09:41,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:42,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:42,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-18 18:09:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:42,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:42,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:42,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 18:09:42,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:42,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:09:42,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:09:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:42,132 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-18 18:09:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:44,795 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-18 18:09:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:09:44,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 18:09:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:44,803 INFO L225 Difference]: With dead ends: 821 [2019-01-18 18:09:44,803 INFO L226 Difference]: Without dead ends: 820 [2019-01-18 18:09:44,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-18 18:09:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-18 18:09:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-18 18:09:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-18 18:09:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-18 18:09:46,707 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-18 18:09:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:46,707 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-18 18:09:46,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:09:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-18 18:09:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:09:46,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:46,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:46,709 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-18 18:09:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:46,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:46,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:46,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:46,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:46,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:46,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:09:46,762 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-18 18:09:46,763 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:46,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:46,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:46,991 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:46,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:46,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:46,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:47,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:47,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:47,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:47,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 18:09:47,015 INFO L478 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 20 treesize of output 22 [2019-01-18 18:09:47,028 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-18 18:09:47,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-18 18:09:47,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:47,109 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:47,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 18:09:47,123 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 18:09:47,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:09:47,132 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,165 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,194 INFO L267 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-01-18 18:09:47,195 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-18 18:09:47,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,219 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 18:09:47,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-18 18:09:47,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:47,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 18:09:47,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:47,249 INFO L267 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-01-18 18:09:47,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-18 18:09:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:47,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:47,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:47,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:09:47,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:47,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:09:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:09:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:47,299 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-18 18:09:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:49,347 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-18 18:09:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:49,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 18:09:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:49,353 INFO L225 Difference]: With dead ends: 805 [2019-01-18 18:09:49,353 INFO L226 Difference]: Without dead ends: 804 [2019-01-18 18:09:49,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:09:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-18 18:09:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-18 18:09:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-18 18:09:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-18 18:09:51,380 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-18 18:09:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:51,381 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-18 18:09:51,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:09:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-18 18:09:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:09:51,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:51,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:51,383 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-18 18:09:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:51,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:51,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:51,575 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-18 18:09:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:09:51,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:51,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:51,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:09:51,623 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-18 18:09:51,624 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:51,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:51,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:51,959 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:51,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:51,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:51,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:51,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:51,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:51,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:51,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:51,980 INFO L478 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 21 treesize of output 23 [2019-01-18 18:09:51,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:51,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:51,994 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:52,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,015 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:52,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:09:52,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,077 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:09:52,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,125 INFO L478 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 36 treesize of output 49 [2019-01-18 18:09:52,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,158 INFO L478 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 32 treesize of output 57 [2019-01-18 18:09:52,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:09:52,204 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,218 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,232 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,275 INFO L267 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-01-18 18:09:52,275 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:09:52,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:09:52,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,337 INFO L267 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-01-18 18:09:52,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:52,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:09:52,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:52,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:09:52,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:52,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:52,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-18 18:09:52,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:52,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:52,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:09:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:52,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:52,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:52,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:09:52,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:52,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:09:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:09:52,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:52,528 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-18 18:09:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:55,338 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-18 18:09:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:09:55,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 18:09:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:55,348 INFO L225 Difference]: With dead ends: 1004 [2019-01-18 18:09:55,348 INFO L226 Difference]: Without dead ends: 1003 [2019-01-18 18:09:55,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:09:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-18 18:09:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-18 18:09:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-18 18:09:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-18 18:09:57,593 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-18 18:09:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:57,593 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-18 18:09:57,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:09:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-18 18:09:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:09:57,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:57,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:57,596 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-18 18:09:57,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:57,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:57,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-01-18 18:09:57,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:57,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:57,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:09:57,687 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-18 18:09:57,688 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:57,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:57,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:57,927 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:57,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:57,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:57,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:09:57,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:57,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:57,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:57,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:09:57,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:57,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:57,977 INFO L478 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 22 treesize of output 38 [2019-01-18 18:09:58,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:09:58,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:09:58,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:09:58,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:09:58,061 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:09:58,066 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:09:58,066 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,082 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,094 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,104 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,114 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,132 INFO L267 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-01-18 18:09:58,133 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-18 18:09:58,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,160 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-18 18:09:58,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:58,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:58,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-18 18:09:58,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:58,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:09:58,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:58,265 INFO L267 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-01-18 18:09:58,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-18 18:09:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:58,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:58,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-18 18:09:58,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:58,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:09:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:09:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:58,330 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-18 18:10:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:01,551 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-18 18:10:01,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:10:01,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 18:10:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:01,560 INFO L225 Difference]: With dead ends: 1213 [2019-01-18 18:10:01,560 INFO L226 Difference]: Without dead ends: 1212 [2019-01-18 18:10:01,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:10:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-18 18:10:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-18 18:10:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-18 18:10:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-18 18:10:04,489 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-18 18:10:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:04,490 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-18 18:10:04,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:10:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-18 18:10:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:10:04,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:04,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:10:04,493 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:04,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:04,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-18 18:10:04,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:04,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:04,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:04,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:04,716 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:10:04,716 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-18 18:10:04,716 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:10:04,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:05,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:10:05,066 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:10:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:05,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:10:05,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:05,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:10:05,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:05,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:10:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:05,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:10:05,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:10:05,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:10:05,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:10:05,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:10:05,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:10:05,149 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,175 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,238 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:10:05,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,271 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:10:05,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:10:05,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:10:05,356 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,374 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,390 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,405 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,435 INFO L267 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-01-18 18:10:05,436 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:10:05,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:10:05,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:05,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:10:05,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,523 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:05,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-18 18:10:05,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:05,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-18 18:10:05,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-18 18:10:05,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:05,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-18 18:10:05,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:05,656 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:05,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 18:10:05,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:05,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:05,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 18:10:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:05,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:10:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:05,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:10:05,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:10:05,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:10:05,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:10:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:10:05,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:10:05,780 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-18 18:10:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:10,145 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-18 18:10:10,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:10:10,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 18:10:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:10,160 INFO L225 Difference]: With dead ends: 1577 [2019-01-18 18:10:10,160 INFO L226 Difference]: Without dead ends: 1575 [2019-01-18 18:10:10,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:10:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-18 18:10:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-18 18:10:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-18 18:10:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-18 18:10:12,145 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-18 18:10:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:12,145 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-18 18:10:12,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:10:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-18 18:10:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:10:12,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:12,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:10:12,146 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:12,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-18 18:10:12,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:12,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:12,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:10:12,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:12,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:12,313 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:10:12,313 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-18 18:10:12,317 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:10:12,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:12,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:10:12,649 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:10:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:12,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:10:12,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:12,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:10:12,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:12,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:10:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:12,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:10:12,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:10:12,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:10:12,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:10:12,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:10:12,726 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:10:12,726 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,771 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,803 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:10:12,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,828 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:10:12,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:10:12,860 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,869 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,878 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,897 INFO L267 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-01-18 18:10:12,898 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 18:10:12,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:10:12,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:12,959 INFO L267 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-01-18 18:10:12,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:10:12,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:12,984 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:12,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-18 18:10:12,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:13,004 INFO L267 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-01-18 18:10:13,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-18 18:10:13,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-18 18:10:13,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:13,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:13,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 18:10:13,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:13,081 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:13,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-18 18:10:13,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:13,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:13,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 18:10:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:13,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:10:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:13,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:10:13,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 18:10:13,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:10:13,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:10:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:10:13,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:10:13,190 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-18 18:10:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:16,563 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-18 18:10:16,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:10:16,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 18:10:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:16,570 INFO L225 Difference]: With dead ends: 1108 [2019-01-18 18:10:16,570 INFO L226 Difference]: Without dead ends: 1107 [2019-01-18 18:10:16,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:10:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-18 18:10:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-18 18:10:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-18 18:10:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-18 18:10:19,407 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-18 18:10:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:19,408 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-18 18:10:19,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:10:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-18 18:10:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:10:19,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:19,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:10:19,410 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-18 18:10:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:19,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:19,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:19,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:10:19,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:19,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:19,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:10:19,498 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-18 18:10:19,499 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:10:19,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:19,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:10:19,999 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:10:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:19,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:10:19,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:19,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:10:20,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:20,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:10:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:20,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:10:20,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:10:20,028 INFO L478 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 21 treesize of output 23 [2019-01-18 18:10:20,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,037 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:10:20,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,051 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:10:20,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:10:20,067 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,106 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:10:20,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,193 INFO L478 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 36 treesize of output 49 [2019-01-18 18:10:20,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,228 INFO L478 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 32 treesize of output 57 [2019-01-18 18:10:20,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:10:20,273 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,286 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,315 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,343 INFO L267 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-01-18 18:10:20,343 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:10:20,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:10:20,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:20,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:20,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:10:20,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:20,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:20,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:10:20,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:10:20,524 INFO L267 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-01-18 18:10:20,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 18:10:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:20,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:10:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:10:20,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:10:20,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:10:20,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:10:20,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:10:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:10:20,593 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-18 18:10:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:23,563 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-18 18:10:23,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:10:23,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 18:10:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:23,568 INFO L225 Difference]: With dead ends: 1075 [2019-01-18 18:10:23,569 INFO L226 Difference]: Without dead ends: 1074 [2019-01-18 18:10:23,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:10:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-18 18:10:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-18 18:10:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-18 18:10:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-18 18:10:26,406 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-18 18:10:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:26,406 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-18 18:10:26,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:10:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-18 18:10:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:10:26,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:26,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:10:26,408 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-18 18:10:26,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:26,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:26,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:26,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:26,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:26,572 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 18:10:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:10:26,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:26,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:26,879 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:10:26,879 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-18 18:10:26,880 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:10:26,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:27,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:10:27,607 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:10:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:27,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:10:27,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:27,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:10:27,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:27,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:10:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:27,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:10:27,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:10:27,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:10:27,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:10:27,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:10:27,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:10:27,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,797 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:10:27,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,829 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:10:27,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:10:27,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:27,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:10:27,913 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,929 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,945 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,961 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:27,990 INFO L267 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-01-18 18:10:27,990 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:10:28,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:10:28,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:28,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:28,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:10:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,174 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:28,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:10:28,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:28,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:28,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-18 18:10:28,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:10:28,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:28,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:28,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-18 18:10:28,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:28,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:28,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 18:10:28,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:28,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:28,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-18 18:10:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:28,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:10:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:28,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:10:28,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:10:28,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:10:28,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:10:28,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:10:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:10:28,438 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-18 18:10:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:32,995 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-18 18:10:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:10:32,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 18:10:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:33,003 INFO L225 Difference]: With dead ends: 1522 [2019-01-18 18:10:33,003 INFO L226 Difference]: Without dead ends: 1521 [2019-01-18 18:10:33,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 18:10:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-18 18:10:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-18 18:10:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-18 18:10:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-18 18:10:36,117 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-18 18:10:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:36,117 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-18 18:10:36,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:10:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-18 18:10:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:10:36,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:36,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:10:36,120 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:36,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:36,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-18 18:10:36,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:36,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:36,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:36,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:36,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:36,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:10:36,163 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-18 18:10:36,164 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:10:36,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:37,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:10:37,369 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:10:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:37,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:10:37,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:37,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:10:37,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:37,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:10:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:37,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:10:37,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:10:37,394 INFO L478 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 21 treesize of output 23 [2019-01-18 18:10:37,403 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 18:10:37,421 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 18:10:37,444 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-18 18:10:37,444 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:37,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:37,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:37,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:37,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:37,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:37,489 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-18 18:10:37,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:37,494 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-18 18:10:37,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:37,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:37,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-18 18:10:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:37,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:10:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:37,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:10:37,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 18:10:37,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:10:37,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:10:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:10:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 18:10:37,528 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-18 18:10:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:41,530 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-18 18:10:41,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:10:41,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-18 18:10:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:41,538 INFO L225 Difference]: With dead ends: 1559 [2019-01-18 18:10:41,539 INFO L226 Difference]: Without dead ends: 1554 [2019-01-18 18:10:41,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 18:10:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-18 18:10:45,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-18 18:10:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-18 18:10:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-18 18:10:45,838 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-18 18:10:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:45,838 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-18 18:10:45,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:10:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-18 18:10:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:10:45,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:45,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:10:45,841 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-18 18:10:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:45,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:10:45,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:45,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:45,906 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:10:45,906 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-18 18:10:45,907 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:10:45,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:46,424 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:10:46,424 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:10:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:46,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:10:46,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:46,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:10:46,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:46,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:10:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:46,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:10:46,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:10:46,449 INFO L478 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 21 treesize of output 23 [2019-01-18 18:10:46,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,458 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:10:46,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,475 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:10:46,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:10:46,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:10:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,596 INFO L478 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 36 treesize of output 49 [2019-01-18 18:10:46,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,638 INFO L478 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 32 treesize of output 57 [2019-01-18 18:10:46,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:10:46,683 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,698 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,711 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,727 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,755 INFO L267 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-01-18 18:10:46,755 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:10:46,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:10:46,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:46,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:46,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:10:46,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:46,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:10:46,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:10:46,944 INFO L267 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-01-18 18:10:46,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 18:10:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:46,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:10:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:47,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:10:47,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:10:47,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:10:47,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:10:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:10:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:10:47,034 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-18 18:10:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:51,384 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-18 18:10:51,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:10:51,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 18:10:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:51,390 INFO L225 Difference]: With dead ends: 1574 [2019-01-18 18:10:51,391 INFO L226 Difference]: Without dead ends: 1570 [2019-01-18 18:10:51,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 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-01-18 18:10:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-18 18:10:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-18 18:10:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-18 18:10:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-18 18:10:55,714 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-18 18:10:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:55,714 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-18 18:10:55,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:10:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-18 18:10:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:10:55,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:55,717 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 18:10:55,717 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-18 18:10:55,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:55,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:55,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:10:55,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:55,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:55,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:10:55,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:10:55,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:55,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:10:55,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:10:55,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:10:55,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:10:55,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:10:55,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:10:55,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:10:55,854 INFO L478 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 21 treesize of output 23 [2019-01-18 18:10:55,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,859 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:10:55,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,866 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:10:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:10:55,875 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:55,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:55,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:55,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:55,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:55,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:10:55,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:55,971 INFO L478 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 36 treesize of output 49 [2019-01-18 18:10:56,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,007 INFO L478 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 32 treesize of output 57 [2019-01-18 18:10:56,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:10:56,054 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:56,069 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:56,083 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:56,099 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:10:56,126 INFO L267 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-01-18 18:10:56,127 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:10:56,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:10:56,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:56,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:56,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 18:10:56,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:10:56,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:10:56,316 INFO L267 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-01-18 18:10:56,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-18 18:10:56,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,364 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:10:56,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 18:10:56,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:56,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:56,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-18 18:10:56,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:10:56,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-18 18:10:56,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:10:56,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:10:56,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-18 18:10:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:56,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:10:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:56,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:10:56,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 18:10:56,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:10:56,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:10:56,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:10:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:10:56,535 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-18 18:11:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:11:02,492 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-18 18:11:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:11:02,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 18:11:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:11:02,497 INFO L225 Difference]: With dead ends: 2098 [2019-01-18 18:11:02,497 INFO L226 Difference]: Without dead ends: 2091 [2019-01-18 18:11:02,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:11:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-18 18:11:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-18 18:11:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-18 18:11:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-18 18:11:07,632 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-18 18:11:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:11:07,632 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-18 18:11:07,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:11:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-18 18:11:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:11:07,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:11:07,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:11:07,634 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:11:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-18 18:11:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:11:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:07,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:11:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:07,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:11:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:07,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:07,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:11:07,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:11:07,692 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-18 18:11:07,693 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:11:07,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:11:08,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:11:08,177 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:11:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:08,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:11:08,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:08,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:11:08,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:11:08,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:11:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:08,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:11:08,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:11:08,266 INFO L478 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 21 treesize of output 23 [2019-01-18 18:11:08,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,273 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:11:08,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,283 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:11:08,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:11:08,296 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:11:08,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,396 INFO L478 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 36 treesize of output 49 [2019-01-18 18:11:08,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,431 INFO L478 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 32 treesize of output 57 [2019-01-18 18:11:08,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:11:08,478 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,491 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,521 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,548 INFO L267 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-01-18 18:11:08,548 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:11:08,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:11:08,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:11:08,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:11:08,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:08,650 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:11:08,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 18:11:08,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:08,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:11:08,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-18 18:11:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:08,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:11:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:08,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:11:08,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:11:08,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:11:08,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:11:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:11:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:11:08,787 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-18 18:11:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:11:13,815 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-18 18:11:13,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:11:13,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 18:11:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:11:13,820 INFO L225 Difference]: With dead ends: 1846 [2019-01-18 18:11:13,820 INFO L226 Difference]: Without dead ends: 1839 [2019-01-18 18:11:13,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:11:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-18 18:11:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-18 18:11:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-18 18:11:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-18 18:11:18,997 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-18 18:11:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:11:18,997 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-18 18:11:18,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:11:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-18 18:11:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:11:18,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:11:18,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:11:19,000 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:11:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-18 18:11:19,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:11:19,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:19,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:11:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:19,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:11:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:11:19,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:19,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:11:19,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:11:19,134 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-18 18:11:19,135 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:11:19,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:11:19,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:11:19,401 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:11:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:19,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:11:19,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:19,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:11:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:11:19,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:11:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:19,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:11:19,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:11:19,427 INFO L478 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 21 treesize of output 23 [2019-01-18 18:11:19,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,435 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:11:19,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,446 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:11:19,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:11:19,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:11:19,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,572 INFO L478 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 36 treesize of output 49 [2019-01-18 18:11:19,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,605 INFO L478 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 32 treesize of output 57 [2019-01-18 18:11:19,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:11:19,651 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,666 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,680 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:19,722 INFO L267 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-01-18 18:11:19,723 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:11:19,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:11:19,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:11:19,855 INFO L267 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-01-18 18:11:19,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-18 18:11:19,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:19,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-01-18 18:11:19,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:20,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-01-18 18:11:20,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:20,054 INFO L267 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-01-18 18:11:20,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-18 18:11:20,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:11:20,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-18 18:11:20,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:20,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,164 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:11:20,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:20,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-18 18:11:20,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:20,220 INFO L267 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-01-18 18:11:20,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-18 18:11:20,421 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-18 18:11:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:20,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:11:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:20,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:11:20,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 18:11:20,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:11:20,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:11:20,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:11:20,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:11:20,495 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-18 18:11:20,681 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-18 18:11:22,225 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-18 18:11:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:11:27,243 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-18 18:11:27,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:11:27,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 18:11:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:11:27,249 INFO L225 Difference]: With dead ends: 2193 [2019-01-18 18:11:27,249 INFO L226 Difference]: Without dead ends: 2192 [2019-01-18 18:11:27,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-18 18:11:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-18 18:11:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-18 18:11:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-18 18:11:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-18 18:11:32,879 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-18 18:11:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:11:32,879 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-18 18:11:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:11:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-18 18:11:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:11:32,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:11:32,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:11:32,882 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:11:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-18 18:11:32,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:11:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:32,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:11:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:32,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:11:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:33,040 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 18:11:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:33,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:33,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:11:33,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:11:33,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:11:33,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:33,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:11:33,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:11:33,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:11:33,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:11:33,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:11:33,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:11:33,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,398 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:11:33,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,431 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:11:33,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:11:33,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:11:33,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:11:33,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:11:33,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:11:33,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:11:33,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:11:33,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,754 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,779 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,789 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,818 INFO L267 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-01-18 18:11:33,819 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:11:33,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:11:33,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:11:33,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:11:33,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:11:33,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:33,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:11:33,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-18 18:11:33,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:33,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,007 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:11:34,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 18:11:34,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:34,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:11:34,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-18 18:11:34,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:34,080 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:11:34,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-18 18:11:34,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:34,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:11:34,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-18 18:11:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:34,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:11:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:34,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:11:34,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:11:34,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:11:34,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:11:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:11:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:11:34,210 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-18 18:11:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:11:41,469 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-18 18:11:41,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:11:41,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 18:11:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:11:41,476 INFO L225 Difference]: With dead ends: 2526 [2019-01-18 18:11:41,476 INFO L226 Difference]: Without dead ends: 2520 [2019-01-18 18:11:41,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:11:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-18 18:11:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-18 18:11:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-18 18:11:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-18 18:11:47,185 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-18 18:11:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:11:47,185 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-18 18:11:47,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:11:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-18 18:11:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:11:47,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:11:47,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:11:47,189 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:11:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-18 18:11:47,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:11:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:47,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:11:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:47,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:11:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:11:47,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:47,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:11:47,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:11:47,277 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-18 18:11:47,278 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:11:47,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:11:47,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:11:47,483 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:11:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:47,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:11:47,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:47,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:11:47,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:11:47,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:11:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:47,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:11:47,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:11:47,511 INFO L478 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 21 treesize of output 23 [2019-01-18 18:11:47,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,533 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:11:47,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,547 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:11:47,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:11:47,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:11:47,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,654 INFO L478 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 36 treesize of output 49 [2019-01-18 18:11:47,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,690 INFO L478 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 32 treesize of output 57 [2019-01-18 18:11:47,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:11:47,736 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,751 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,765 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,781 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:47,808 INFO L267 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-01-18 18:11:47,809 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:11:47,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:47,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:11:47,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:11:48,028 INFO L267 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-01-18 18:11:48,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-18 18:11:48,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:48,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:48,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:11:48,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 18:11:48,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:48,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:11:48,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-18 18:11:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:48,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:11:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:11:48,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:11:48,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-18 18:11:48,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:11:48,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:11:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:11:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:11:48,150 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-18 18:11:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:11:53,740 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-18 18:11:53,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:11:53,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 18:11:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:11:53,746 INFO L225 Difference]: With dead ends: 1971 [2019-01-18 18:11:53,746 INFO L226 Difference]: Without dead ends: 1964 [2019-01-18 18:11:53,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:11:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-18 18:11:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-18 18:11:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-18 18:11:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-18 18:11:59,474 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-18 18:11:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:11:59,474 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-18 18:11:59,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:11:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-18 18:11:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:11:59,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:11:59,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:11:59,479 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:11:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:11:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-18 18:11:59,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:11:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:59,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:11:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:11:59,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:11:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:11:59,625 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 18:11:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:11:59,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:59,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:11:59,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:11:59,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:11:59,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:11:59,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:11:59,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:11:59,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:11:59,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:11:59,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:11:59,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:11:59,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:11:59,717 INFO L478 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 21 treesize of output 23 [2019-01-18 18:11:59,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,724 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:11:59,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,731 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:11:59,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:11:59,741 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:11:59,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,833 INFO L478 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 36 treesize of output 49 [2019-01-18 18:11:59,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,868 INFO L478 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 32 treesize of output 57 [2019-01-18 18:11:59,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:11:59,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:11:59,913 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,927 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,941 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,956 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:11:59,982 INFO L267 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-01-18 18:11:59,982 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:12:00,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:12:00,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:00,044 INFO L267 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-01-18 18:12:00,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:12:00,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 18:12:00,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:00,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:12:00,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:12:00,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:00,120 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:00,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-18 18:12:00,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:00,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:12:00,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:12:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:00,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:12:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:00,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:12:00,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 18:12:00,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:12:00,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:12:00,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:12:00,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:12:00,222 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-18 18:12:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:12:06,066 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-18 18:12:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:12:06,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 18:12:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:12:06,071 INFO L225 Difference]: With dead ends: 2036 [2019-01-18 18:12:06,071 INFO L226 Difference]: Without dead ends: 2033 [2019-01-18 18:12:06,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:12:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-18 18:12:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-18 18:12:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-18 18:12:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-18 18:12:11,954 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-18 18:12:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:12:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-18 18:12:11,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:12:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-18 18:12:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:12:11,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:12:11,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:12:11,958 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:12:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:12:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-18 18:12:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:12:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:12:11,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:12:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:12:11,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:12:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:12:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:12:12,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:12:12,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:12:12,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:12:12,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:12:12,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:12:12,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:12:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:12:12,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:12:12,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:12:12,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:12:12,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:12:12,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,067 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:12:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,104 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:12:12,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:12:12,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:12:12,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:12:12,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:12:12,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:12:12,217 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 18:12:12,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,258 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,287 INFO L267 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-01-18 18:12:12,288 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-18 18:12:12,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-18 18:12:12,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:12:12,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-18 18:12:12,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-18 18:12:12,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-18 18:12:12,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-18 18:12:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,649 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:12,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-18 18:12:12,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:12,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-18 18:12:12,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-18 18:12:12,855 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-18 18:12:12,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:12,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-01-18 18:12:12,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 18:12:13,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,335 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:13,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 18:12:13,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:13,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-01-18 18:12:13,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-18 18:12:13,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-18 18:12:13,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,547 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:13,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-01-18 18:12:13,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 18:12:13,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,704 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:13,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-18 18:12:13,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:13,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-01-18 18:12:13,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:13,851 INFO L267 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-01-18 18:12:13,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-18 18:12:15,798 WARN L181 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-18 18:12:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:15,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:12:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:15,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:12:15,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 18:12:15,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:12:15,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:12:15,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:12:15,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:12:15,943 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-18 18:12:16,733 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-01-18 18:12:18,280 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-18 18:12:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:12:25,477 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-18 18:12:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:12:25,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 18:12:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:12:25,485 INFO L225 Difference]: With dead ends: 2952 [2019-01-18 18:12:25,485 INFO L226 Difference]: Without dead ends: 2951 [2019-01-18 18:12:25,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-18 18:12:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-18 18:12:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-18 18:12:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-18 18:12:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-18 18:12:30,738 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-18 18:12:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:12:30,738 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-18 18:12:30,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:12:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-18 18:12:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:12:30,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:12:30,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:12:30,741 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:12:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:12:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-18 18:12:30,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:12:30,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:12:30,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:12:30,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:12:30,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:12:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:12:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:12:30,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:12:30,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:12:30,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:12:30,895 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-18 18:12:30,896 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:12:30,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:12:31,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:12:31,102 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:12:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:12:31,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:12:31,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:12:31,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:12:31,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:12:31,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:12:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:12:31,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:12:31,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:12:31,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,154 INFO L478 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 36 treesize of output 49 [2019-01-18 18:12:31,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,198 INFO L478 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 32 treesize of output 57 [2019-01-18 18:12:31,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:12:31,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:12:31,315 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:12:31,318 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:12:31,320 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:12:31,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:12:31,325 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,346 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,368 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,404 INFO L267 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-01-18 18:12:31,405 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:12:31,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:12:31,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:12:31,529 INFO L267 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-01-18 18:12:31,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-18 18:12:31,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,601 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:31,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-01-18 18:12:31,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:31,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-18 18:12:31,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:31,719 INFO L267 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-01-18 18:12:31,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-18 18:12:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:31,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:12:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:31,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:12:31,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-18 18:12:31,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:12:31,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:12:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:12:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:12:31,831 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-18 18:12:32,207 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-18 18:12:34,503 WARN L181 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-18 18:12:42,641 WARN L181 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-18 18:12:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:12:48,365 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-18 18:12:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:12:48,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 18:12:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:12:48,370 INFO L225 Difference]: With dead ends: 1903 [2019-01-18 18:12:48,370 INFO L226 Difference]: Without dead ends: 1896 [2019-01-18 18:12:48,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:12:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-18 18:12:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-18 18:12:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-18 18:12:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-18 18:12:54,232 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-18 18:12:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:12:54,232 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-18 18:12:54,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:12:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-18 18:12:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:12:54,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:12:54,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:12:54,235 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:12:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:12:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-18 18:12:54,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:12:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:12:54,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:12:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:12:54,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:12:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:12:54,571 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-01-18 18:12:54,851 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-18 18:12:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:12:54,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:12:54,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:12:54,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:12:54,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:12:54,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:12:54,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:12:54,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:12:54,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:12:55,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:12:55,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:12:55,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:12:55,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:12:55,063 INFO L478 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 21 treesize of output 23 [2019-01-18 18:12:55,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,148 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:12:55,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,254 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-18 18:12:55,255 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:12:55,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,390 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-18 18:12:55,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:12:55,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:12:55,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,588 INFO L478 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 36 treesize of output 49 [2019-01-18 18:12:55,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,622 INFO L478 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 32 treesize of output 57 [2019-01-18 18:12:55,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:12:55,668 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,683 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,713 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,741 INFO L267 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-01-18 18:12:55,742 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:12:55,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:12:55,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:12:55,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:12:55,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:12:55,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:12:55,821 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:12:55,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:12:55,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:12:55,923 INFO L267 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-01-18 18:12:55,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-01-18 18:12:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:55,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:12:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:12:55,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:12:55,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:12:55,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:12:55,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:12:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:12:55,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:12:55,999 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-18 18:13:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:13:01,640 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-18 18:13:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:13:01,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 18:13:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:13:01,645 INFO L225 Difference]: With dead ends: 1884 [2019-01-18 18:13:01,645 INFO L226 Difference]: Without dead ends: 1877 [2019-01-18 18:13:01,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:13:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-18 18:13:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-18 18:13:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-18 18:13:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-18 18:13:07,537 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-18 18:13:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:13:07,537 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-18 18:13:07,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:13:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-18 18:13:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:13:07,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:13:07,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:13:07,541 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:13:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:13:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-18 18:13:07,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:13:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:13:07,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:13:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:13:07,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:13:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:13:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:13:07,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:13:07,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:13:07,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:13:07,664 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-18 18:13:07,665 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:13:07,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:13:07,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:13:07,958 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:13:07,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:13:07,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:13:07,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:13:07,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:13:07,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:13:07,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:13:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:13:07,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:13:07,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:13:07,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,001 INFO L478 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 36 treesize of output 49 [2019-01-18 18:13:08,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,047 INFO L478 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 32 treesize of output 57 [2019-01-18 18:13:08,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:13:08,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:13:08,174 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:13:08,193 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:13:08,218 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:13:08,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:13:08,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,243 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,255 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,264 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,274 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,301 INFO L267 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-01-18 18:13:08,301 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:13:08,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 18:13:08,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:13:08,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 18:13:08,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-18 18:13:08,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:08,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:13:08,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-18 18:13:08,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:08,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:13:08,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 18:13:08,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:13:08,551 INFO L267 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-01-18 18:13:08,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-18 18:13:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:13:08,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:13:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:13:08,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:13:08,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 18:13:08,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:13:08,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:13:08,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:13:08,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:13:08,638 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-18 18:13:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:13:17,595 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-18 18:13:17,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:13:17,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 18:13:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:13:17,603 INFO L225 Difference]: With dead ends: 2991 [2019-01-18 18:13:17,603 INFO L226 Difference]: Without dead ends: 2978 [2019-01-18 18:13:17,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:13:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-18 18:13:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-18 18:13:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-18 18:13:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-18 18:13:25,613 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-18 18:13:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:13:25,613 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-18 18:13:25,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:13:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-18 18:13:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:13:25,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:13:25,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:13:25,617 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:13:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:13:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-18 18:13:25,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:13:25,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:13:25,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:13:25,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:13:25,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:13:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:13:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:13:25,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:13:25,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:13:25,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:13:25,753 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-18 18:13:25,754 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:13:25,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:13:26,183 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:13:26,183 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-18 18:13:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:13:26,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:13:26,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:13:26,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:13:26,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:13:26,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:13:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:13:26,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:13:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,228 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:13:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,263 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:13:26,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:13:26,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:13:26,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:13:26,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:13:26,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:13:26,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:13:26,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:13:26,431 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,454 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,466 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,514 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-18 18:13:26,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:13:26,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,578 INFO L267 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-01-18 18:13:26,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-18 18:13:26,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-18 18:13:26,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:13:26,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 18:13:26,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,686 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:13:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-18 18:13:26,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:13:26,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-18 18:13:26,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:13:26,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-18 18:13:26,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:13:26,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-18 18:13:26,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:13:26,831 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:13:26,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 18:13:26,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:13:26,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:13:26,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-18 18:13:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:13:26,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:13:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:13:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:13:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 18:13:27,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:13:27,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 18:13:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 18:13:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:13:27,665 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-18 18:13:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:13:37,789 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-18 18:13:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:13:37,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-18 18:13:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:13:37,798 INFO L225 Difference]: With dead ends: 3181 [2019-01-18 18:13:37,798 INFO L226 Difference]: Without dead ends: 3179 [2019-01-18 18:13:37,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-18 18:13:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-18 18:13:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-18 18:13:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-18 18:13:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-18 18:13:45,424 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-18 18:13:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:13:45,424 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-18 18:13:45,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 18:13:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-18 18:13:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:13:45,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:13:45,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:13:45,428 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:13:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:13:45,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-18 18:13:45,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:13:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:13:45,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:13:45,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:13:45,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:13:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:13:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:13:45,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:13:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 18:13:45,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:13:45,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:13:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:13:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 18:13:45,498 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-18 18:13:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:13:52,556 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-18 18:13:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:13:52,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-18 18:13:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:13:52,562 INFO L225 Difference]: With dead ends: 2346 [2019-01-18 18:13:52,563 INFO L226 Difference]: Without dead ends: 2337 [2019-01-18 18:13:52,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-18 18:13:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-18 18:14:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-18 18:14:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-18 18:14:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-18 18:14:00,117 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-18 18:14:00,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:00,117 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-18 18:14:00,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:14:00,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-18 18:14:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:00,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:00,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:00,121 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-18 18:14:00,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:00,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:00,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:00,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:14:00,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:00,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:00,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:14:00,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:14:00,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:00,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:14:00,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:14:00,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 18:14:00,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:14:00,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:00,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,294 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:14:00,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,327 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:14:00,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:14:00,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:14:00,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:00,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:14:00,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:14:00,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:14:00,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:14:00,497 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,520 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,533 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,544 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,584 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-18 18:14:00,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:14:00,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,649 INFO L267 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-01-18 18:14:00,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-18 18:14:00,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 18:14:00,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:00,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:00,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 18:14:00,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:00,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:01,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,022 INFO L303 Elim1Store]: Index analysis took 259 ms [2019-01-18 18:14:01,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-18 18:14:01,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:01,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:01,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-18 18:14:01,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,321 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:01,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 18:14:01,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:01,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:01,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 18:14:01,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:01,391 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:01,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 18:14:01,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:01,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:01,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-18 18:14:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:01,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:01,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:01,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 18:14:01,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:01,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 18:14:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 18:14:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:14:01,563 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-18 18:14:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:09,600 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-18 18:14:09,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:14:09,600 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-18 18:14:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:09,606 INFO L225 Difference]: With dead ends: 2345 [2019-01-18 18:14:09,606 INFO L226 Difference]: Without dead ends: 2338 [2019-01-18 18:14:09,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-18 18:14:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-18 18:14:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-18 18:14:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-18 18:14:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-18 18:14:11,776 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-18 18:14:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:11,776 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-18 18:14:11,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 18:14:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-18 18:14:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:11,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:11,778 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:11,778 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-18 18:14:11,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:11,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:14:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:11,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:14:11,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:11,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:11,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:14:11,872 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-18 18:14:11,872 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:14:11,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:14:12,138 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:14:12,139 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:14:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:12,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:14:12,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:12,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:12,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:12,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:14:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:12,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:12,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:12,166 INFO L478 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 21 treesize of output 23 [2019-01-18 18:14:12,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,177 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:12,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,185 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:12,193 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:14:12,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:14:12,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,268 INFO L478 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 22 treesize of output 38 [2019-01-18 18:14:12,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:14:12,298 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,315 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,334 INFO L267 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-01-18 18:14:12,335 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 18:14:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,363 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 18:14:12,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-18 18:14:12,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,403 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 18:14:12,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-18 18:14:12,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,437 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-18 18:14:12,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,455 INFO L267 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-01-18 18:14:12,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-18 18:14:12,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:12,479 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-18 18:14:12,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:12,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:12,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-18 18:14:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:12,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:12,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:12,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 18:14:12,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:12,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:14:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:14:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:14:12,573 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-18 18:14:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:14,895 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-18 18:14:14,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:14:14,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 18:14:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:14,897 INFO L225 Difference]: With dead ends: 480 [2019-01-18 18:14:14,897 INFO L226 Difference]: Without dead ends: 477 [2019-01-18 18:14:14,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:14:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-18 18:14:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-18 18:14:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-18 18:14:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-18 18:14:15,839 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-18 18:14:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:15,839 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-18 18:14:15,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:14:15,839 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-18 18:14:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:15,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:15,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:15,840 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-18 18:14:15,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:15,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:15,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:15,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:15,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:14:15,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:15,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:15,898 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:14:15,898 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 18:14:15,899 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:14:15,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:14:16,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:14:16,205 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:14:16,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:16,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:14:16,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:16,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:16,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:16,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:14:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:16,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:16,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:16,267 INFO L478 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 21 treesize of output 23 [2019-01-18 18:14:16,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,275 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:16,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,286 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:16,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:14:16,299 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:14:16,519 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-18 18:14:16,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,523 INFO L478 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 36 treesize of output 49 [2019-01-18 18:14:16,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,568 INFO L478 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 32 treesize of output 57 [2019-01-18 18:14:16,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:14:16,613 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,627 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,641 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,656 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,682 INFO L267 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-01-18 18:14:16,683 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:14:16,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:14:16,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,735 INFO L267 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-01-18 18:14:16,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:14:16,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 18:14:16,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:16,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:14:16,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:16,806 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:16,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-18 18:14:16,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:16,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:16,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:14:16,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-01-18 18:14:16,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:16,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:16,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 18:14:16,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:16,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:14:16,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:14:16,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:14:16,897 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-18 18:14:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:18,747 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-18 18:14:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:14:18,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 18:14:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:18,749 INFO L225 Difference]: With dead ends: 250 [2019-01-18 18:14:18,749 INFO L226 Difference]: Without dead ends: 243 [2019-01-18 18:14:18,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:14:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-18 18:14:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-18 18:14:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-18 18:14:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-18 18:14:20,258 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-18 18:14:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:20,258 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-18 18:14:20,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:14:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-18 18:14:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:20,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:20,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:20,259 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:20,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-18 18:14:20,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:20,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:20,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:20,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:20,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:14:20,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:20,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:20,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:14:20,391 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-18 18:14:20,392 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:14:20,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:14:20,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:14:20,666 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:14:20,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:20,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:14:20,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:20,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:20,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:20,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:14:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:20,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:20,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:20,687 INFO L478 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 21 treesize of output 23 [2019-01-18 18:14:20,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,695 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:20,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,707 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:20,727 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-18 18:14:20,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:14:20,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,808 INFO L478 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 22 treesize of output 38 [2019-01-18 18:14:20,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 18:14:20,837 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,845 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,853 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,872 INFO L267 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-01-18 18:14:20,872 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-18 18:14:20,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,903 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 18:14:20,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-18 18:14:20,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,930 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 18:14:20,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,945 INFO L267 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-01-18 18:14:20,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-18 18:14:20,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:20,966 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:20,967 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-18 18:14:20,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:20,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:20,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-18 18:14:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:20,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:21,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:21,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:14:21,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:21,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:14:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:14:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:14:21,046 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-18 18:14:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:24,258 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-18 18:14:24,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:14:24,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 18:14:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:24,260 INFO L225 Difference]: With dead ends: 372 [2019-01-18 18:14:24,260 INFO L226 Difference]: Without dead ends: 362 [2019-01-18 18:14:24,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:14:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-18 18:14:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-18 18:14:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-18 18:14:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-18 18:14:26,581 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-18 18:14:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:26,581 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-18 18:14:26,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:14:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-18 18:14:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:26,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:26,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:26,583 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-18 18:14:26,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:26,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:26,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:26,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:26,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:14:26,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:14:26,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:26,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:26,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:14:26,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:14:26,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:14:26,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:14:26,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:26,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:26,694 INFO L478 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 21 treesize of output 23 [2019-01-18 18:14:26,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,700 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:26,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,707 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:26,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:14:26,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:14:26,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,825 INFO L478 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 36 treesize of output 49 [2019-01-18 18:14:26,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,861 INFO L478 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 32 treesize of output 57 [2019-01-18 18:14:26,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:14:26,905 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,919 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,949 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:26,976 INFO L267 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-01-18 18:14:26,976 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:14:26,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:26,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:14:27,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:27,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:27,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:14:27,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,053 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:27,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:14:27,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:14:27,151 INFO L267 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-01-18 18:14:27,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-18 18:14:27,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:27,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 18:14:27,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:27,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:27,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-18 18:14:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:27,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:27,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:27,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:14:27,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:27,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:14:27,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:14:27,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:14:27,295 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-18 18:14:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:30,240 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-18 18:14:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:14:30,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 18:14:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:30,242 INFO L225 Difference]: With dead ends: 332 [2019-01-18 18:14:30,242 INFO L226 Difference]: Without dead ends: 325 [2019-01-18 18:14:30,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:14:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-18 18:14:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-18 18:14:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-18 18:14:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-18 18:14:32,696 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-18 18:14:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:32,696 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-18 18:14:32,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:14:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-18 18:14:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:32,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:32,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:32,697 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-18 18:14:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:32,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:32,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:14:32,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:32,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:14:32,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:32,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:32,777 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:14:32,777 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-18 18:14:32,778 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:14:32,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:14:33,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:14:33,403 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:14:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:33,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:14:33,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:33,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:33,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:33,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:14:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:33,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:33,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:14:33,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,443 INFO L478 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 36 treesize of output 49 [2019-01-18 18:14:33,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,489 INFO L478 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 32 treesize of output 57 [2019-01-18 18:14:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:14:33,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:33,633 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:14:33,635 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:33,639 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:33,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:14:33,642 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,684 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,693 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,720 INFO L267 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-01-18 18:14:33,721 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:14:33,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:14:33,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,784 INFO L267 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-01-18 18:14:33,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:14:33,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,813 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:33,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 18:14:33,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:33,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 18:14:33,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:33,856 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:33,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 18:14:33,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:33,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:33,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 18:14:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:33,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:33,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:33,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:14:33,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:33,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:14:33,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:14:33,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:14:33,971 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-18 18:14:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:38,103 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-18 18:14:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:14:38,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 18:14:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:38,105 INFO L225 Difference]: With dead ends: 294 [2019-01-18 18:14:38,105 INFO L226 Difference]: Without dead ends: 287 [2019-01-18 18:14:38,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:14:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-18 18:14:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-18 18:14:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-18 18:14:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-18 18:14:40,530 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-18 18:14:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:40,531 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-18 18:14:40,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:14:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-18 18:14:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:40,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:40,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:40,532 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-18 18:14:40,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:40,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:40,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:40,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:40,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:14:40,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:40,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:40,645 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:14:40,646 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-18 18:14:40,647 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:14:40,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:14:41,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:14:41,274 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:14:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:41,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:14:41,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:41,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:41,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:41,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:14:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:41,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:41,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:41,316 INFO L478 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 21 treesize of output 23 [2019-01-18 18:14:41,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,322 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:41,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,331 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:41,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:14:41,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:14:41,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,438 INFO L478 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 36 treesize of output 49 [2019-01-18 18:14:41,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,474 INFO L478 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 32 treesize of output 57 [2019-01-18 18:14:41,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:14:41,519 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,532 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,546 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,561 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,588 INFO L267 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-01-18 18:14:41,589 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:14:41,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:14:41,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:41,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 18:14:41,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:14:41,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:14:41,836 INFO L267 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-01-18 18:14:41,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-18 18:14:41,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,911 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:41,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-01-18 18:14:41,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:41,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:41,974 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:41,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-18 18:14:41,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:42,025 INFO L267 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-01-18 18:14:42,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-18 18:14:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:42,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:42,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:42,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 18:14:42,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:42,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:14:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:14:42,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:14:42,744 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-18 18:14:43,042 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-18 18:14:43,282 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-18 18:14:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:46,421 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-18 18:14:46,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:14:46,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 18:14:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:46,423 INFO L225 Difference]: With dead ends: 364 [2019-01-18 18:14:46,423 INFO L226 Difference]: Without dead ends: 357 [2019-01-18 18:14:46,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:14:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-18 18:14:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-18 18:14:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-18 18:14:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-18 18:14:49,036 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-18 18:14:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:49,036 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-18 18:14:49,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:14:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-18 18:14:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:49,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:49,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:49,037 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-18 18:14:49,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:49,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:14:49,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:49,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:49,121 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:14:49,121 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-18 18:14:49,122 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:14:49,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:14:49,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:14:49,724 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:14:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:49,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:14:49,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:49,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:49,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:14:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:49,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:49,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:49,750 INFO L478 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 21 treesize of output 23 [2019-01-18 18:14:49,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,757 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:49,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,773 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:49,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:14:49,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:14:49,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,872 INFO L478 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 36 treesize of output 49 [2019-01-18 18:14:49,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,908 INFO L478 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 32 treesize of output 57 [2019-01-18 18:14:49,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:49,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:14:49,953 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,966 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,980 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:49,995 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:50,022 INFO L267 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-01-18 18:14:50,022 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:14:50,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:14:50,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:50,085 INFO L267 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-01-18 18:14:50,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:14:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 18:14:50,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:50,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:50,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-18 18:14:50,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:50,163 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:50,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 18:14:50,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:50,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:14:50,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:14:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:50,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:50,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:50,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 18:14:50,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:50,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:14:50,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:14:50,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:14:50,261 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-18 18:14:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:14:53,393 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-18 18:14:53,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:14:53,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 18:14:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:14:53,394 INFO L225 Difference]: With dead ends: 319 [2019-01-18 18:14:53,394 INFO L226 Difference]: Without dead ends: 312 [2019-01-18 18:14:53,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:14:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-18 18:14:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-18 18:14:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-18 18:14:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-18 18:14:56,336 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-18 18:14:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:14:56,336 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-18 18:14:56,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:14:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-18 18:14:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:14:56,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:14:56,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:14:56,337 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:14:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-18 18:14:56,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:14:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:56,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:14:56,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:14:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:14:56,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:56,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:14:56,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:14:56,463 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-18 18:14:56,464 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:14:56,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:14:56,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:14:56,735 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:14:56,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:14:56,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:14:56,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:14:56,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:14:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:14:56,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:14:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:14:56,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:14:56,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:14:56,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,778 INFO L478 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 36 treesize of output 49 [2019-01-18 18:14:56,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,816 INFO L478 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 32 treesize of output 57 [2019-01-18 18:14:56,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:56,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:14:56,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:56,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:56,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:56,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:56,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:14:56,944 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:14:56,948 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:14:56,951 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:14:56,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:14:56,955 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:56,975 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:56,987 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:56,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:57,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:14:57,034 INFO L267 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-01-18 18:14:57,034 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:14:57,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:14:57,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:14:57,167 INFO L267 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-01-18 18:14:57,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-18 18:14:57,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-18 18:14:57,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-18 18:14:57,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:57,374 INFO L267 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-01-18 18:14:57,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-18 18:14:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,426 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:57,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-18 18:14:57,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,488 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:14:57,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:14:57,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-18 18:14:57,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:14:57,530 INFO L267 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-01-18 18:14:57,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-18 18:14:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:57,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:14:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:14:57,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:14:57,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 18:14:57,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:14:57,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:14:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:14:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:14:57,640 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-18 18:14:57,861 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-18 18:14:59,321 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-18 18:15:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:15:02,395 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-18 18:15:02,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:15:02,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 18:15:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:15:02,397 INFO L225 Difference]: With dead ends: 392 [2019-01-18 18:15:02,397 INFO L226 Difference]: Without dead ends: 386 [2019-01-18 18:15:02,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-18 18:15:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-18 18:15:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-18 18:15:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-18 18:15:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-18 18:15:05,526 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-18 18:15:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:15:05,526 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-18 18:15:05,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:15:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-18 18:15:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:15:05,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:15:05,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:15:05,527 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:15:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-18 18:15:05,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:15:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:05,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:15:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:05,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:15:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:15:05,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:15:05,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 18:15:05,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:15:05,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:15:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:15:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 18:15:05,609 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-18 18:15:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:15:08,636 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-18 18:15:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:15:08,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-18 18:15:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:15:08,638 INFO L225 Difference]: With dead ends: 320 [2019-01-18 18:15:08,638 INFO L226 Difference]: Without dead ends: 315 [2019-01-18 18:15:08,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-18 18:15:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-18 18:15:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-18 18:15:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-18 18:15:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-18 18:15:11,818 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-18 18:15:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:15:11,818 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-18 18:15:11,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:15:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-18 18:15:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:15:11,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:15:11,819 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:15:11,819 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:15:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-18 18:15:11,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:15:11,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:11,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:15:11,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:11,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:15:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:15:11,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:11,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:15:11,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:15:11,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:15:11,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:11,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:15:11,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:15:11,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:15:11,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:15:11,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:15:11,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:15:11,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:15:11,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:11,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:11,959 INFO L478 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 36 treesize of output 49 [2019-01-18 18:15:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:11,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:11,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:11,993 INFO L478 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 32 treesize of output 57 [2019-01-18 18:15:12,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:15:12,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:15:12,108 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:15:12,112 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:15:12,115 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:15:12,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:15:12,119 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,139 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,152 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,161 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,171 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,198 INFO L267 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-01-18 18:15:12,198 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:15:12,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 18:15:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:12,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-18 18:15:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-18 18:15:12,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:12,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-18 18:15:12,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 18:15:12,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:15:12,457 INFO L267 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-01-18 18:15:12,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-18 18:15:12,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:12,513 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:15:12,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-18 18:15:12,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:12,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:12,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:15:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:12,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:15:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:12,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:15:12,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 18:15:12,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:15:12,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:15:12,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:15:12,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:15:12,636 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-18 18:15:19,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:15:19,076 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-18 18:15:19,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:15:19,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 18:15:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:15:19,078 INFO L225 Difference]: With dead ends: 601 [2019-01-18 18:15:19,078 INFO L226 Difference]: Without dead ends: 591 [2019-01-18 18:15:19,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-18 18:15:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-18 18:15:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-18 18:15:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-18 18:15:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-18 18:15:24,249 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-18 18:15:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:15:24,249 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-18 18:15:24,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:15:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-18 18:15:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:15:24,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:15:24,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:15:24,250 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:15:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:24,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-18 18:15:24,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:15:24,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:24,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:15:24,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:24,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:15:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:15:24,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:24,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:15:24,336 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:15:24,336 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 18:15:24,336 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:15:24,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:15:24,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:15:24,632 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:15:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:24,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:15:24,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:24,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:15:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:15:24,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:15:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:24,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:15:24,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:15:24,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,674 INFO L478 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 36 treesize of output 49 [2019-01-18 18:15:24,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,723 INFO L478 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 32 treesize of output 57 [2019-01-18 18:15:24,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:15:24,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:15:24,847 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:15:24,850 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:15:24,854 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:15:24,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:15:24,857 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,878 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,890 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,908 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,935 INFO L267 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-01-18 18:15:24,935 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:15:24,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:24,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 18:15:24,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:24,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:24,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:15:25,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-18 18:15:25,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:25,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:25,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-18 18:15:25,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,076 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:15:25,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:25,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-01-18 18:15:25,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:15:25,180 INFO L267 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-01-18 18:15:25,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-18 18:15:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:25,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:15:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:25,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:15:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:15:25,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:15:25,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:15:25,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:15:25,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:15:25,271 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-18 18:15:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:15:35,062 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-18 18:15:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:15:35,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 18:15:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:15:35,064 INFO L225 Difference]: With dead ends: 731 [2019-01-18 18:15:35,064 INFO L226 Difference]: Without dead ends: 718 [2019-01-18 18:15:35,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:15:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-18 18:15:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-18 18:15:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-18 18:15:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-18 18:15:43,611 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-18 18:15:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:15:43,611 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-18 18:15:43,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:15:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-18 18:15:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:15:43,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:15:43,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:15:43,612 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:15:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-18 18:15:43,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:15:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:43,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:15:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:43,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:15:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:15:43,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:43,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:15:43,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:15:43,763 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 18:15:43,767 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:15:43,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:15:44,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:15:44,132 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:15:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:44,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:15:44,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:44,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:15:44,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:15:44,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:15:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:44,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:15:44,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:15:44,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,176 INFO L478 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 36 treesize of output 49 [2019-01-18 18:15:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,214 INFO L478 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 32 treesize of output 57 [2019-01-18 18:15:44,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:15:44,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:15:44,342 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:15:44,345 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:15:44,349 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:15:44,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:15:44,353 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,392 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,404 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,412 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,422 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,449 INFO L267 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-01-18 18:15:44,449 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:15:44,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:15:44,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-18 18:15:44,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:15:44,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,563 INFO L267 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-01-18 18:15:44,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-18 18:15:44,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,593 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:15:44,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 18:15:44,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:44,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-18 18:15:44,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:44,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:15:44,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-18 18:15:44,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:44,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:44,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-18 18:15:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:44,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:15:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:44,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:15:44,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 18:15:44,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:15:44,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:15:44,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:15:44,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:15:44,784 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-18 18:15:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:15:54,869 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-18 18:15:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:15:54,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 18:15:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:15:54,871 INFO L225 Difference]: With dead ends: 480 [2019-01-18 18:15:54,871 INFO L226 Difference]: Without dead ends: 473 [2019-01-18 18:15:54,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-18 18:15:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-18 18:15:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-18 18:15:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-18 18:15:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-18 18:15:58,158 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-18 18:15:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:15:58,158 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-18 18:15:58,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:15:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-18 18:15:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:15:58,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:15:58,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:15:58,159 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:15:58,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:58,160 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-18 18:15:58,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:15:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:58,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:15:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:15:58,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:15:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:58,390 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-18 18:15:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:15:58,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:58,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:15:58,572 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:15:58,572 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-18 18:15:58,574 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:15:58,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:15:58,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:15:58,848 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:15:58,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:15:58,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:15:58,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:15:58,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:15:58,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:15:58,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:15:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:15:58,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:15:58,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:15:58,869 INFO L478 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 21 treesize of output 23 [2019-01-18 18:15:58,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,884 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:15:58,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,891 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:15:58,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:15:58,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:58,927 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:58,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:58,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:58,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:58,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:15:58,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:58,996 INFO L478 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 36 treesize of output 49 [2019-01-18 18:15:59,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,030 INFO L478 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 32 treesize of output 57 [2019-01-18 18:15:59,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:15:59,074 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:59,089 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:59,103 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:59,118 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:15:59,145 INFO L267 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-01-18 18:15:59,145 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:15:59,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:15:59,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:59,208 INFO L267 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-01-18 18:15:59,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:15:59,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 18:15:59,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:59,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:59,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:15:59,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,285 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:15:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:15:59,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-18 18:15:59,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:15:59,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:15:59,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:15:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:59,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:15:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:15:59,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:15:59,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:15:59,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:15:59,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:15:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:15:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:15:59,381 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-18 18:16:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:16:04,689 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-18 18:16:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:16:04,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 18:16:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:16:04,691 INFO L225 Difference]: With dead ends: 258 [2019-01-18 18:16:04,691 INFO L226 Difference]: Without dead ends: 243 [2019-01-18 18:16:04,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:16:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-18 18:16:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-18 18:16:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-18 18:16:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-18 18:16:09,246 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-18 18:16:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:16:09,246 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-18 18:16:09,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:16:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-18 18:16:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:16:09,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:16:09,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:16:09,248 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:16:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:09,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-18 18:16:09,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:16:09,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:09,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:09,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:16:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:16:09,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:09,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:16:09,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:16:09,402 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-18 18:16:09,403 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:16:09,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:16:10,152 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:16:10,152 INFO L272 AbstractInterpreter]: Visited 9 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:16:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:10,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:16:10,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:10,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:16:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:10,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:16:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:10,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:16:10,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:16:10,176 INFO L478 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 21 treesize of output 23 [2019-01-18 18:16:10,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,187 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:16:10,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,196 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:16:10,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:16:10,205 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,229 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:16:10,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,300 INFO L478 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 36 treesize of output 49 [2019-01-18 18:16:10,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,333 INFO L478 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 32 treesize of output 57 [2019-01-18 18:16:10,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:16:10,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,393 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,423 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,450 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-18 18:16:10,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:16:10,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,514 INFO L267 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-01-18 18:16:10,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-18 18:16:10,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,550 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:16:10,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 18:16:10,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:16:10,650 INFO L267 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-01-18 18:16:10,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-18 18:16:10,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,700 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:16:10,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-18 18:16:10,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-01-18 18:16:10,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,811 INFO L267 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-01-18 18:16:10,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-18 18:16:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,876 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:16:10,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-18 18:16:10,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:10,942 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:16:10,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-18 18:16:10,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:10,985 INFO L267 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-01-18 18:16:10,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-18 18:16:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:11,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:16:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:11,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:16:11,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:16:11,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:16:11,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:16:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:16:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:16:11,101 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-18 18:16:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:16:17,345 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-18 18:16:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:16:17,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 18:16:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:16:17,347 INFO L225 Difference]: With dead ends: 295 [2019-01-18 18:16:17,347 INFO L226 Difference]: Without dead ends: 284 [2019-01-18 18:16:17,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-18 18:16:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-18 18:16:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-18 18:16:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-18 18:16:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-18 18:16:22,113 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-18 18:16:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:16:22,113 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-18 18:16:22,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:16:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-18 18:16:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:16:22,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:16:22,114 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:16:22,114 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:16:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-18 18:16:22,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:16:22,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:22,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:22,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:22,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:16:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 18:16:22,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:22,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:16:22,204 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:16:22,204 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-18 18:16:22,205 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:16:22,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:16:22,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:16:22,692 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:16:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:22,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:16:22,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:22,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:16:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:22,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:16:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:22,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:16:22,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:16:22,714 INFO L478 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 21 treesize of output 23 [2019-01-18 18:16:22,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,731 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:16:22,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,744 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:16:22,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:16:22,753 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,779 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:16:22,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,852 INFO L478 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 36 treesize of output 49 [2019-01-18 18:16:22,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,887 INFO L478 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 32 treesize of output 57 [2019-01-18 18:16:22,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:22,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:16:22,932 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,946 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,960 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:22,976 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:23,003 INFO L267 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-01-18 18:16:23,004 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-18 18:16:23,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-18 18:16:23,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:23,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:23,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-18 18:16:23,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 18:16:23,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:16:23,177 INFO L267 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-01-18 18:16:23,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-18 18:16:23,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:23,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 18:16:23,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:23,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:23,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-18 18:16:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:23,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:16:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:23,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:16:23,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:16:23,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:16:23,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:16:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:16:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:16:23,328 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-18 18:16:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:16:30,301 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-18 18:16:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:16:30,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 18:16:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:16:30,303 INFO L225 Difference]: With dead ends: 328 [2019-01-18 18:16:30,303 INFO L226 Difference]: Without dead ends: 315 [2019-01-18 18:16:30,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:16:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-18 18:16:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-18 18:16:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-18 18:16:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-18 18:16:37,109 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-18 18:16:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:16:37,109 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-18 18:16:37,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:16:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-18 18:16:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:16:37,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:16:37,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:16:37,110 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:16:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-18 18:16:37,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:16:37,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:37,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:37,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:37,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:16:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:16:37,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:37,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:16:37,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:16:37,295 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-18 18:16:37,296 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:16:37,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:16:37,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:16:37,571 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:16:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:37,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:16:37,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:37,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:16:37,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:37,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:16:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:37,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:16:37,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,607 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:16:37,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,639 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:16:37,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:16:37,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:16:37,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:16:37,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:16:37,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:16:37,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:16:37,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:16:37,841 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,864 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,877 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,928 INFO L267 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-01-18 18:16:37,928 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:16:37,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:37,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:16:37,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:37,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:37,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:16:38,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-18 18:16:38,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:38,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:38,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-18 18:16:38,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,090 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:16:38,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:38,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-18 18:16:38,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:38,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:38,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-18 18:16:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:38,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:16:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:38,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:16:38,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:16:38,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:16:38,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:16:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:16:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:16:38,212 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-18 18:16:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:16:47,562 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-18 18:16:47,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:16:47,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 18:16:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:16:47,564 INFO L225 Difference]: With dead ends: 326 [2019-01-18 18:16:47,564 INFO L226 Difference]: Without dead ends: 313 [2019-01-18 18:16:47,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:16:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-18 18:16:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-18 18:16:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-18 18:16:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-18 18:16:55,752 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-18 18:16:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:16:55,752 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-18 18:16:55,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:16:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-18 18:16:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:16:55,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:16:55,753 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:16:55,753 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:16:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-18 18:16:55,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:16:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:55,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:16:55,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:16:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 18:16:55,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:55,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:16:55,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:16:55,851 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-18 18:16:55,852 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:16:55,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:16:56,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:16:56,182 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:16:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:16:56,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:16:56,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:16:56,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:16:56,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:16:56,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:16:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:16:56,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:16:56,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:16:56,279 INFO L478 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 21 treesize of output 23 [2019-01-18 18:16:56,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,367 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:16:56,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,474 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-18 18:16:56,474 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:16:56,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,597 INFO L303 Elim1Store]: Index analysis took 121 ms [2019-01-18 18:16:56,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:16:56,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:16:56,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,738 INFO L478 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 36 treesize of output 49 [2019-01-18 18:16:56,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,772 INFO L478 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 32 treesize of output 57 [2019-01-18 18:16:56,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:16:56,815 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,830 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,844 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:16:56,886 INFO L267 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-01-18 18:16:56,886 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:16:56,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:56,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:16:56,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:16:57,009 INFO L267 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-01-18 18:16:57,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-18 18:16:57,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,074 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:16:57,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-18 18:16:57,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:57,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:57,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-18 18:16:57,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-18 18:16:57,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:57,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:57,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 18:16:57,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:16:57,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-18 18:16:57,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:16:57,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:16:57,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-18 18:16:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:57,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:16:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:16:57,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:16:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 18:16:57,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:16:57,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:16:57,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:16:57,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:16:57,273 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-18 18:17:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:17:08,630 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-18 18:17:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:17:08,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 18:17:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:17:08,632 INFO L225 Difference]: With dead ends: 400 [2019-01-18 18:17:08,632 INFO L226 Difference]: Without dead ends: 393 [2019-01-18 18:17:08,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:17:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-18 18:17:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-18 18:17:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-18 18:17:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-18 18:17:18,984 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-18 18:17:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:17:18,984 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-18 18:17:18,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:17:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-18 18:17:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:17:18,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:17:18,985 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:17:18,985 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:17:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:17:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-18 18:17:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:17:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:17:18,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:17:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:17:18,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:17:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:17:19,217 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-01-18 18:17:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 18:17:19,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:17:19,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:17:19,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:17:19,278 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-18 18:17:19,279 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:17:19,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:17:19,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:17:19,556 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:17:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:17:19,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:17:19,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:17:19,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:17:19,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:17:19,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:17:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:17:19,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:17:19,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:17:19,574 INFO L478 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 21 treesize of output 23 [2019-01-18 18:17:19,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,581 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:17:19,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,605 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:17:19,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:17:19,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:17:19,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,713 INFO L478 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 36 treesize of output 49 [2019-01-18 18:17:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,749 INFO L478 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 32 treesize of output 57 [2019-01-18 18:17:19,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:17:19,795 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,810 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,824 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,839 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:19,867 INFO L267 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-01-18 18:17:19,867 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-18 18:17:19,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:19,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:17:19,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:17:19,994 INFO L267 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-01-18 18:17:19,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-18 18:17:20,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,061 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:17:20,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-01-18 18:17:20,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:20,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:17:20,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-01-18 18:17:20,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:20,167 INFO L267 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-01-18 18:17:20,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-18 18:17:20,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-01-18 18:17:20,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:20,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,273 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:17:20,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-18 18:17:20,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:20,313 INFO L267 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-01-18 18:17:20,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-18 18:17:20,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-01-18 18:17:20,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:20,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:20,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-18 18:17:20,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:20,473 INFO L267 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-01-18 18:17:20,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-18 18:17:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:17:20,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:17:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:17:20,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:17:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 18:17:20,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:17:20,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:17:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:17:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:17:20,586 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-18 18:17:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:17:32,985 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-18 18:17:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 18:17:32,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 18:17:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:17:32,987 INFO L225 Difference]: With dead ends: 441 [2019-01-18 18:17:32,987 INFO L226 Difference]: Without dead ends: 428 [2019-01-18 18:17:32,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-18 18:17:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-18 18:17:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-18 18:17:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-18 18:17:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-18 18:17:43,498 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-18 18:17:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:17:43,498 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-18 18:17:43,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:17:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-18 18:17:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:17:43,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:17:43,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:17:43,499 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:17:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:17:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-18 18:17:43,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:17:43,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:17:43,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:17:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:17:43,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:17:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:17:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 18:17:43,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:17:43,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:17:43,637 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:17:43,637 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-18 18:17:43,638 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:17:43,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:17:43,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:17:43,994 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:17:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:17:43,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:17:43,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:17:43,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:17:44,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:17:44,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:17:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:17:44,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:17:44,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:17:44,019 INFO L478 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 21 treesize of output 23 [2019-01-18 18:17:44,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,028 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:17:44,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,042 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:17:44,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:17:44,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,076 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:17:44,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,146 INFO L478 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 36 treesize of output 49 [2019-01-18 18:17:44,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,183 INFO L478 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 32 treesize of output 57 [2019-01-18 18:17:44,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:17:44,228 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,243 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,273 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,300 INFO L267 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-01-18 18:17:44,301 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:17:44,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:17:44,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:17:44,432 INFO L267 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-01-18 18:17:44,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-18 18:17:44,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-01-18 18:17:44,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-01-18 18:17:44,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,637 INFO L267 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-01-18 18:17:44,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-18 18:17:44,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,691 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:17:44,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-18 18:17:44,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:17:44,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-18 18:17:44,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,813 INFO L267 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-01-18 18:17:44,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-18 18:17:44,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,865 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:17:44,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-01-18 18:17:44,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:17:44,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:17:44,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-01-18 18:17:44,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:17:44,980 INFO L267 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-01-18 18:17:44,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-18 18:17:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:17:45,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:17:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:17:45,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:17:45,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:17:45,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:17:45,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:17:45,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:17:45,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:17:45,105 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-18 18:18:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:18:05,503 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-18 18:18:05,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 18:18:05,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 18:18:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:18:05,505 INFO L225 Difference]: With dead ends: 685 [2019-01-18 18:18:05,505 INFO L226 Difference]: Without dead ends: 677 [2019-01-18 18:18:05,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-18 18:18:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-18 18:18:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-18 18:18:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-18 18:18:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-18 18:18:21,157 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-18 18:18:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:18:21,157 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-18 18:18:21,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:18:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-18 18:18:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:18:21,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:18:21,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:18:21,158 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:18:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:18:21,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-18 18:18:21,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:18:21,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:18:21,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:18:21,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:18:21,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:18:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:18:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:18:21,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:18:21,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:18:21,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:18:21,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:18:21,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:18:21,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:18:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:18:21,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:18:21,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:18:21,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:18:21,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:18:21,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:18:21,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,343 INFO L478 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 36 treesize of output 49 [2019-01-18 18:18:21,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,379 INFO L478 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 32 treesize of output 57 [2019-01-18 18:18:21,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:18:21,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:18:21,495 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:18:21,498 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:18:21,501 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:18:21,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:18:21,505 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,526 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,539 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,549 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,558 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:21,586 INFO L267 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-01-18 18:18:21,586 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:18:21,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 18:18:21,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:18:21,731 INFO L267 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-01-18 18:18:21,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-18 18:18:21,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:21,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-18 18:18:21,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:22,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,256 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:22,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-18 18:18:22,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:22,297 INFO L267 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-01-18 18:18:22,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-18 18:18:22,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,362 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:22,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-18 18:18:22,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:22,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-18 18:18:22,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:22,467 INFO L267 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-01-18 18:18:22,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-18 18:18:22,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-18 18:18:22,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:22,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:22,575 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:22,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-01-18 18:18:22,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:22,626 INFO L267 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-01-18 18:18:22,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-18 18:18:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:18:22,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:18:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:18:22,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:18:22,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-18 18:18:22,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:18:22,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 18:18:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 18:18:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:18:22,752 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-18 18:18:24,670 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-18 18:18:26,931 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-18 18:18:29,176 WARN L181 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-18 18:18:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:18:42,860 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-18 18:18:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:18:42,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-18 18:18:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:18:42,862 INFO L225 Difference]: With dead ends: 550 [2019-01-18 18:18:42,862 INFO L226 Difference]: Without dead ends: 543 [2019-01-18 18:18:42,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-18 18:18:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-18 18:18:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-18 18:18:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 18:18:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-18 18:18:45,927 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-18 18:18:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:18:45,927 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-18 18:18:45,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 18:18:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-18 18:18:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 18:18:45,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:18:45,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:18:45,928 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:18:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:18:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-18 18:18:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:18:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:18:45,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:18:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:18:45,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:18:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:18:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:18:46,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:18:46,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:18:46,016 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 18:18:46,016 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 18:18:46,016 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:18:46,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:18:46,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:18:46,377 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:18:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:18:46,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:18:46,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:18:46,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:18:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:18:46,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:18:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:18:46,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:18:46,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,414 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-18 18:18:46,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,448 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-18 18:18:46,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-18 18:18:46,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:46,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-18 18:18:46,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:46,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:46,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:46,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:46,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:18:46,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 18:18:46,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 18:18:46,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 18:18:46,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 18:18:46,645 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:47,034 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:47,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:47,409 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:47,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:47,941 INFO L267 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-01-18 18:18:47,942 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-18 18:18:48,321 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-18 18:18:48,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 18:18:48,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:48,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:18:48,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-18 18:18:48,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 18:18:48,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:48,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:18:48,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-18 18:18:48,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,508 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:48,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-18 18:18:48,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:48,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:18:48,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-18 18:18:48,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:48,764 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:48,764 INFO L303 Elim1Store]: Index analysis took 194 ms [2019-01-18 18:18:48,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 18:18:48,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:48,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:18:48,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 18:18:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:18:49,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:18:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:18:49,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:18:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-18 18:18:49,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:18:49,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 18:18:49,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 18:18:49,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:18:49,249 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-18 18:18:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:18:55,156 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-18 18:18:55,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:18:55,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-18 18:18:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:18:55,157 INFO L225 Difference]: With dead ends: 67 [2019-01-18 18:18:55,157 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 18:18:55,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-18 18:18:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 18:18:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-18 18:18:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 18:18:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-18 18:18:58,414 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-18 18:18:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:18:58,414 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-18 18:18:58,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 18:18:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-18 18:18:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 18:18:58,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:18:58,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:18:58,415 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:18:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:18:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-18 18:18:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:18:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:18:58,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:18:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:18:58,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:18:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:18:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 18:18:58,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:18:58,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:18:58,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 18:18:58,600 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-18 18:18:58,601 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:18:58,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:18:58,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:18:58,946 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:18:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:18:58,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:18:58,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:18:58,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:18:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:18:58,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:18:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:18:58,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:18:58,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:18:58,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:58,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:58,983 INFO L478 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 36 treesize of output 49 [2019-01-18 18:18:59,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,020 INFO L478 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 32 treesize of output 57 [2019-01-18 18:18:59,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:18:59,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:18:59,135 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:18:59,137 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:18:59,141 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:18:59,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:18:59,144 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,164 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,176 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,186 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,195 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,222 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-18 18:18:59,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-18 18:18:59,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,285 INFO L267 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-01-18 18:18:59,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-18 18:18:59,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-18 18:18:59,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:18:59,428 INFO L267 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-01-18 18:18:59,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-18 18:18:59,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,483 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:59,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-18 18:18:59,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,548 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:59,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-01-18 18:18:59,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,600 INFO L267 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-01-18 18:18:59,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-18 18:18:59,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,660 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:59,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-01-18 18:18:59,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:18:59,728 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:18:59,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-18 18:18:59,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:18:59,771 INFO L267 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-01-18 18:18:59,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-18 18:18:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:18:59,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:18:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:18:59,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:18:59,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:18:59,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:18:59,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:18:59,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:18:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:18:59,924 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-18 18:19:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:19:06,201 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-18 18:19:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:19:06,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-18 18:19:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:19:06,203 INFO L225 Difference]: With dead ends: 74 [2019-01-18 18:19:06,203 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 18:19:06,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-18 18:19:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 18:19:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-18 18:19:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 18:19:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-18 18:19:09,791 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-18 18:19:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:19:09,791 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-18 18:19:09,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:19:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-18 18:19:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 18:19:09,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:19:09,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:19:09,792 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:19:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:19:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-18 18:19:09,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:19:09,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:19:09,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:19:09,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:19:09,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:19:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:19:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 18:19:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:19:09,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:19:09,929 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 18:19:09,929 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 18:19:09,930 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:19:09,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:19:10,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:19:10,296 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:19:10,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:19:10,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:19:10,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:19:10,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:19:10,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:19:10,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:19:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:19:10,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:19:10,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-18 18:19:10,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,334 INFO L478 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 36 treesize of output 49 [2019-01-18 18:19:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,369 INFO L478 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 32 treesize of output 57 [2019-01-18 18:19:10,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-18 18:19:10,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:19:10,483 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 18:19:10,488 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-18 18:19:10,491 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-18 18:19:10,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-18 18:19:10,494 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,515 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,537 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,574 INFO L267 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-01-18 18:19:10,575 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-18 18:19:10,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:19:10,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,640 INFO L267 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-01-18 18:19:10,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:19:10,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 18:19:10,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:19:10,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-18 18:19:10,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,786 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:19:10,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-18 18:19:10,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:19:10,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:19:10,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:10,842 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:19:10,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-18 18:19:10,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:10,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:19:10,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 18:19:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:19:10,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:19:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:19:10,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:19:10,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-18 18:19:10,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:19:10,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 18:19:10,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 18:19:10,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:19:10,951 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-18 18:19:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:19:18,263 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-18 18:19:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:19:18,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-18 18:19:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:19:18,264 INFO L225 Difference]: With dead ends: 80 [2019-01-18 18:19:18,265 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 18:19:18,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-18 18:19:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 18:19:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-18 18:19:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 18:19:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-18 18:19:24,769 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-18 18:19:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:19:24,769 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-18 18:19:24,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 18:19:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-18 18:19:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 18:19:24,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:19:24,769 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:19:24,770 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:19:24,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:19:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-18 18:19:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:19:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:19:24,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:19:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:19:24,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:19:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:19:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-18 18:19:24,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:19:24,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:19:24,872 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:19:24,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:19:24,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:19:24,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:19:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:19:24,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:19:24,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 18:19:24,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:19:24,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:19:24,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 18:19:24,894 INFO L478 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 21 treesize of output 23 [2019-01-18 18:19:24,902 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 18:19:24,911 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 18:19:24,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:24,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:24,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:24,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:24,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-18 18:19:24,924 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:24,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:24,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:24,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:24,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:24,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 18:19:24,986 INFO L478 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 20 treesize of output 22 [2019-01-18 18:19:24,989 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-18 18:19:25,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-18 18:19:25,010 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,024 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,032 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,048 INFO L267 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-01-18 18:19:25,049 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-18 18:19:25,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,084 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 18:19:25,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:19:25,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 18:19:25,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-18 18:19:25,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-18 18:19:25,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,168 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-18 18:19:25,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 18:19:25,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-18 18:19:25,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,228 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-18 18:19:25,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-18 18:19:25,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 18:19:25,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-18 18:19:25,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-18 18:19:25,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,339 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-18 18:19:25,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-18 18:19:25,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-18 18:19:25,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,395 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:19:25,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,396 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-01-18 18:19:25,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:19:25,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-18 18:19:25,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:19:25,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-18 18:19:25,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-18 18:19:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:19:25,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:19:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:19:25,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:19:25,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-18 18:19:25,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:19:25,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 18:19:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 18:19:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:19:25,566 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-18 18:19:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:19:32,490 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-18 18:19:32,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:19:32,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-18 18:19:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:19:32,490 INFO L225 Difference]: With dead ends: 71 [2019-01-18 18:19:32,491 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 18:19:32,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-18 18:19:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 18:19:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 18:19:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 18:19:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 18:19:32,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-18 18:19:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:19:32,492 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 18:19:32,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 18:19:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 18:19:32,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 18:19:32,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 18:19:32,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:32,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:32,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:32,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:38,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:44,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:47,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:47,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:48,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:19:49,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:20:09,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:20:19,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent.