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-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:33:31,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:33:31,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:33:31,353 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:33:31,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:33:31,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:33:31,357 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:33:31,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:33:31,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:33:31,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:33:31,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:33:31,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:33:31,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:33:31,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:33:31,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:33:31,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:33:31,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:33:31,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:33:31,387 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:33:31,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:33:31,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:33:31,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:33:31,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:33:31,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:33:31,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:33:31,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:33:31,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:33:31,403 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:33:31,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:33:31,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:33:31,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:33:31,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:33:31,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:33:31,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:33:31,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:33:31,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:33:31,410 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-08 14:33:31,432 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:33:31,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:33:31,433 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:33:31,433 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:33:31,434 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:33:31,434 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:33:31,434 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:33:31,434 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:33:31,434 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:33:31,435 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-08 14:33:31,435 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-08 14:33:31,435 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:33:31,435 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:33:31,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:33:31,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:33:31,436 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:33:31,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:33:31,437 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:33:31,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:33:31,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:33:31,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:33:31,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:33:31,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:33:31,438 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:33:31,438 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:33:31,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:33:31,438 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:33:31,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:33:31,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:33:31,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:33:31,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:33:31,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:33:31,440 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:33:31,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:33:31,440 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:33:31,440 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:33:31,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:33:31,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:33:31,441 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:33:31,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:33:31,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:33:31,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:33:31,500 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:33:31,501 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:33:31,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-01-08 14:33:31,502 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-08 14:33:31,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:33:31,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:33:31,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:33:31,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:33:31,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:33:31,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:33:31,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:33:31,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:33:31,621 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:33:31,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/1) ... [2019-01-08 14:33:31,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:33:31,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:33:31,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:33:31,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:33:31,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 14:33:31,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:33:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:33:32,079 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:33:32,079 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-08 14:33:32,083 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:33:32 BoogieIcfgContainer [2019-01-08 14:33:32,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:33:32,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:33:32,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:33:32,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:33:32,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:33:31" (1/2) ... [2019-01-08 14:33:32,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d69eca and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:33:32, skipping insertion in model container [2019-01-08 14:33:32,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:33:32" (2/2) ... [2019-01-08 14:33:32,093 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-08 14:33:32,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:33:32,116 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-08 14:33:32,136 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-08 14:33:32,175 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:33:32,175 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:33:32,176 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:33:32,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:33:32,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:33:32,176 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:33:32,176 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:33:32,177 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:33:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-08 14:33:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:33:32,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:32,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:33:32,200 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-08 14:33:32,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:32,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:32,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:32,452 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-08 14:33:32,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:33:32,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:33:32,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:33:32,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:33:32,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:33:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:33:32,493 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-08 14:33:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:32,712 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-08 14:33:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:33:32,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:33:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:32,732 INFO L225 Difference]: With dead ends: 21 [2019-01-08 14:33:32,732 INFO L226 Difference]: Without dead ends: 16 [2019-01-08 14:33:32,736 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-08 14:33:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-08 14:33:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-08 14:33:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-08 14:33:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-08 14:33:32,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-08 14:33:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:32,787 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-08 14:33:32,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:33:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-08 14:33:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:33:32,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:32,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:33:32,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-08 14:33:32,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:32,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:32,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:32,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:33,034 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-08 14:33:33,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:33,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:33,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:33:33,038 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-08 14:33:33,103 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:33,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:37,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:37,151 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-08 14:33:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:37,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:37,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:37,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 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-08 14:33:37,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:37,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:37,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:37,406 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-08 14:33:37,438 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 15 treesize of output 18 [2019-01-08 14:33:37,456 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 18 treesize of output 24 [2019-01-08 14:33:37,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:37,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:37,520 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 20 treesize of output 34 [2019-01-08 14:33:37,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:37,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:37,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:37,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:33:37,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:37,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:38,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:38,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:38,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,254 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-08 14:33:38,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,342 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-08 14:33:38,572 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-08 14:33:38,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,580 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-08 14:33:38,582 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:38,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:38,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:38,669 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-08 14:33:38,670 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:38,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:38,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, 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-08 14:33:38,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:38,874 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-08 14:33:38,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:38,920 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-08 14:33:38,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:38,936 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-08 14:33:38,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:38,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:33:38,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:38,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:33:38,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:33:38,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:33:38,962 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-08 14:33:39,306 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-08 14:33:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:39,582 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-08 14:33:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:33:39,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:33:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:39,585 INFO L225 Difference]: With dead ends: 31 [2019-01-08 14:33:39,585 INFO L226 Difference]: Without dead ends: 28 [2019-01-08 14:33:39,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:33:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-08 14:33:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-08 14:33:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:33:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-08 14:33:39,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-08 14:33:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:39,591 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-08 14:33:39,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:33:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-08 14:33:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:33:39,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:39,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:33:39,593 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-08 14:33:39,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:39,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:39,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:39,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:39,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:39,645 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-08 14:33:39,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:33:39,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:33:39,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:33:39,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:33:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:33:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:33:39,647 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-08 14:33:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:39,709 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-08 14:33:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:33:39,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 14:33:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:39,710 INFO L225 Difference]: With dead ends: 15 [2019-01-08 14:33:39,710 INFO L226 Difference]: Without dead ends: 14 [2019-01-08 14:33:39,711 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-08 14:33:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-08 14:33:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-08 14:33:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:33:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-08 14:33:39,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-08 14:33:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:39,715 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-08 14:33:39,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:33:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-08 14:33:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:33:39,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:39,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:33:39,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-08 14:33:39,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:39,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:39,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:39,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:39,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:39,770 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-08 14:33:39,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:39,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:39,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:33:39,771 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-08 14:33:39,774 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:39,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:40,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:40,047 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-08 14:33:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:40,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:40,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:40,048 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-08 14:33:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:40,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:40,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:40,179 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 15 treesize of output 18 [2019-01-08 14:33:40,193 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 18 treesize of output 24 [2019-01-08 14:33:40,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:40,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:40,258 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 20 treesize of output 34 [2019-01-08 14:33:40,348 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:33:40,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:40,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:40,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:40,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:40,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:40,450 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 17 treesize of output 29 [2019-01-08 14:33:40,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:40,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:40,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-08 14:33:40,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:40,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:40,501 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-08 14:33:40,502 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-01-08 14:33:40,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:40,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, 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-08 14:33:40,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:40,589 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-08 14:33:40,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:33:40,606 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-08 14:33:40,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:40,623 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-08 14:33:40,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:33:40,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:33:40,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:33:40,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:33:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:33:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:33:40,643 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-08 14:33:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:40,775 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-08 14:33:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:33:40,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:33:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:40,776 INFO L225 Difference]: With dead ends: 18 [2019-01-08 14:33:40,777 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 14:33:40,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:33:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 14:33:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-08 14:33:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 14:33:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-08 14:33:40,786 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-08 14:33:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:40,786 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-08 14:33:40,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:33:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-08 14:33:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:33:40,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:40,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:33:40,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-08 14:33:40,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:40,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:40,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:40,840 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-08 14:33:40,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:40,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:40,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:33:40,841 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-08 14:33:40,844 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:40,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:41,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:41,124 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-08 14:33:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:41,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:41,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:41,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 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-08 14:33:41,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:41,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:41,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:41,282 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-08 14:33:41,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:41,308 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 17 treesize of output 29 [2019-01-08 14:33:41,605 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-08 14:33:41,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:41,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:41,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-08 14:33:41,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:41,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:41,908 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 15 treesize of output 18 [2019-01-08 14:33:41,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 [2019-01-08 14:33:41,936 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 20 treesize of output 34 [2019-01-08 14:33:41,993 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:33:41,994 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:42,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:42,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:42,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:42,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-08 14:33:42,093 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-08 14:33:42,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:42,186 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-08 14:33:42,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:42,221 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-08 14:33:42,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:33:42,239 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-08 14:33:42,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:42,257 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-08 14:33:42,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:42,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:33:42,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:42,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:33:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:33:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:33:42,279 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-08 14:33:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:42,427 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-08 14:33:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:33:42,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:33:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:42,429 INFO L225 Difference]: With dead ends: 32 [2019-01-08 14:33:42,429 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 14:33:42,430 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-08 14:33:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 14:33:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-08 14:33:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 14:33:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-08 14:33:42,438 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-08 14:33:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:42,438 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-08 14:33:42,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:33:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-08 14:33:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:33:42,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:42,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:33:42,440 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-08 14:33:42,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:42,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:42,517 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-08 14:33:42,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:42,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:42,518 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:33:42,518 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-08 14:33:42,520 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:42,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:44,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:44,987 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-08 14:33:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:44,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:44,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:44,988 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-08 14:33:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:44,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:45,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:45,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,032 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-08 14:33:45,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,085 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-08 14:33:45,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,131 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-08 14:33:45,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,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 15 treesize of output 18 [2019-01-08 14:33:45,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:33:45,180 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 20 treesize of output 34 [2019-01-08 14:33:45,189 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 22 treesize of output 45 [2019-01-08 14:33:45,190 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,216 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,224 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,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-08 14:33:45,251 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:45,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:45,277 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-08 14:33:45,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:45,301 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-08 14:33:45,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:45,325 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-08 14:33:45,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:45,368 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-08 14:33:45,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:33:45,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:33:45,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:33:45,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:33:45,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:33:45,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:33:45,388 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-08 14:33:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:45,426 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-08 14:33:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:33:45,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:33:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:45,432 INFO L225 Difference]: With dead ends: 22 [2019-01-08 14:33:45,432 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 14:33:45,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 14:33:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 14:33:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-08 14:33:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-08 14:33:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-08 14:33:45,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-08 14:33:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:45,438 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-08 14:33:45,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:33:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-08 14:33:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:33:45,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:45,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:33:45,440 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-08 14:33:45,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:45,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:45,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:33:45,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:45,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:45,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:33:45,514 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-08 14:33:45,517 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:45,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:46,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:46,197 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-08 14:33:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:46,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:46,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:46,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 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-08 14:33:46,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:46,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:46,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:46,266 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 15 treesize of output 18 [2019-01-08 14:33:46,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, 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 24 [2019-01-08 14:33:46,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:33:46,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,299 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 22 treesize of output 45 [2019-01-08 14:33:46,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,371 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-08 14:33:46,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,400 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-08 14:33:46,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,435 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-08 14:33:46,436 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,447 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,504 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-08 14:33:46,505 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:46,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,536 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-08 14:33:46,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,558 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-08 14:33:46,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:46,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:46,584 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:33:46,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 33 treesize of output 60 [2019-01-08 14:33:46,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:46,608 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-08 14:33:46,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-08 14:33:46,625 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-08 14:33:46,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:46,664 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-08 14:33:46,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:46,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:33:46,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:46,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:33:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:33:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:33:46,686 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-08 14:33:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:47,151 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-08 14:33:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:33:47,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:33:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:47,153 INFO L225 Difference]: With dead ends: 37 [2019-01-08 14:33:47,154 INFO L226 Difference]: Without dead ends: 36 [2019-01-08 14:33:47,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-08 14:33:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-08 14:33:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-08 14:33:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:33:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-08 14:33:47,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-08 14:33:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:47,161 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-08 14:33:47,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:33:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-08 14:33:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:33:47,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:47,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:33:47,162 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-08 14:33:47,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:47,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:47,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:47,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:47,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:33:47,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:47,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:47,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:33:47,277 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-08 14:33:47,278 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:47,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:47,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:47,957 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-08 14:33:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:47,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:47,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:47,957 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-08 14:33:47,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:47,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:47,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:47,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:47,996 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-08 14:33:48,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,056 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-08 14:33:48,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,145 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-08 14:33:48,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,184 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 15 treesize of output 18 [2019-01-08 14:33:48,189 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 18 treesize of output 24 [2019-01-08 14:33:48,192 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 20 treesize of output 34 [2019-01-08 14:33:48,198 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 22 treesize of output 45 [2019-01-08 14:33:48,198 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,212 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,262 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-08 14:33:48,262 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:48,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,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-08 14:33:48,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,339 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-08 14:33:48,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:48,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:48,370 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-08 14:33:48,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:48,413 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-08 14:33:48,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:33:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:33:48,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:48,487 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-08 14:33:48,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:48,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:33:48,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:48,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:33:48,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:33:48,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:33:48,509 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-08 14:33:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:48,852 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-01-08 14:33:48,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:33:48,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:33:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:48,854 INFO L225 Difference]: With dead ends: 46 [2019-01-08 14:33:48,854 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 14:33:48,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:33:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 14:33:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-08 14:33:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 14:33:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-08 14:33:48,868 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-08 14:33:48,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:48,868 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-08 14:33:48,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:33:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-08 14:33:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:33:48,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:48,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:33:48,869 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-08 14:33:48,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:48,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:48,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:49,073 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-08 14:33:49,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:49,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:49,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:33:49,074 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-08 14:33:49,077 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:49,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:49,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:49,761 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-08 14:33:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:49,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:49,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:49,761 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-08 14:33:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:49,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:49,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:49,802 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 15 treesize of output 18 [2019-01-08 14:33:49,806 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 18 treesize of output 24 [2019-01-08 14:33:49,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,816 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 20 treesize of output 34 [2019-01-08 14:33:49,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,845 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 22 treesize of output 45 [2019-01-08 14:33:49,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:49,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:49,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:49,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:49,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,911 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-08 14:33:49,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,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-08 14:33:49,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:49,973 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-08 14:33:49,974 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:49,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:49,991 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,010 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-08 14:33:50,010 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:50,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,033 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-08 14:33:50,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,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-08 14:33:50,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:50,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,076 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-08 14:33:50,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,098 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-08 14:33:50,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:33:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:33:50,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:50,125 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-08 14:33:50,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:50,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:33:50,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:50,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:33:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:33:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:33:50,147 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-08 14:33:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:50,334 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-01-08 14:33:50,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:33:50,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:33:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:50,336 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:33:50,336 INFO L226 Difference]: Without dead ends: 49 [2019-01-08 14:33:50,337 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-08 14:33:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-08 14:33:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-01-08 14:33:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:33:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-01-08 14:33:50,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-01-08 14:33:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:50,346 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-01-08 14:33:50,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:33:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-01-08 14:33:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:33:50,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:50,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:33:50,347 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-08 14:33:50,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:50,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:50,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:33:50,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:50,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:50,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:33:50,404 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-08 14:33:50,405 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:50,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:50,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:50,569 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-08 14:33:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:50,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:50,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:50,569 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-08 14:33:50,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:50,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:50,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:50,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,604 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 17 treesize of output 29 [2019-01-08 14:33:50,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-08 14:33:50,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,663 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 15 treesize of output 18 [2019-01-08 14:33:50,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 [2019-01-08 14:33:50,670 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 20 treesize of output 34 [2019-01-08 14:33:50,679 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:33:50,680 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,724 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-08 14:33:50,725 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-08 14:33:50,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:50,749 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-08 14:33:50,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:50,760 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-08 14:33:50,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:33:50,772 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-08 14:33:50,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:50,809 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-08 14:33:50,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:50,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:33:50,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:50,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:33:50,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:33:50,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:33:50,831 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-01-08 14:33:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:51,044 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-01-08 14:33:51,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:33:51,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:33:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:51,046 INFO L225 Difference]: With dead ends: 36 [2019-01-08 14:33:51,046 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 14:33:51,047 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-08 14:33:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 14:33:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-08 14:33:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 14:33:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-01-08 14:33:51,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-01-08 14:33:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:51,056 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-01-08 14:33:51,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:33:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-01-08 14:33:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:33:51,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:51,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:33:51,059 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:51,059 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-08 14:33:51,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:51,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:51,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:51,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:51,128 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-08 14:33:51,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:51,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:51,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:33:51,128 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-08 14:33:51,129 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:51,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:51,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:51,405 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-08 14:33:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:51,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:51,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:51,405 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-08 14:33:51,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:51,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:51,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:51,455 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 15 treesize of output 18 [2019-01-08 14:33:51,463 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 18 treesize of output 24 [2019-01-08 14:33:51,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,486 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 20 treesize of output 34 [2019-01-08 14:33:51,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:33:51,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,565 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-08 14:33:51,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,601 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-08 14:33:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,653 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-08 14:33:51,654 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,674 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,694 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-08 14:33:51,694 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:51,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,736 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-08 14:33:51,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,756 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-08 14:33:51,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:51,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:51,789 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-08 14:33:51,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:51,814 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-08 14:33:51,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:33:51,831 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-08 14:33:51,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:51,857 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-08 14:33:51,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:51,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:33:51,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:51,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:33:51,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:33:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:33:51,880 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-01-08 14:33:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:52,261 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-01-08 14:33:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:33:52,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:33:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:52,262 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:33:52,263 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 14:33:52,263 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-08 14:33:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 14:33:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-01-08 14:33:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:33:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-01-08 14:33:52,272 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-01-08 14:33:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:52,272 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-01-08 14:33:52,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:33:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-01-08 14:33:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:33:52,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:52,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:33:52,273 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-08 14:33:52,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:52,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:52,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:52,309 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-08 14:33:52,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:52,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:52,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:33:52,310 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-08 14:33:52,311 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:52,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:52,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:52,510 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-08 14:33:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:52,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:52,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:52,511 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-08 14:33:52,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:52,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:52,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:52,545 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 15 treesize of output 18 [2019-01-08 14:33:52,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, 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 20 [2019-01-08 14:33:52,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,663 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 20 treesize of output 30 [2019-01-08 14:33:52,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,748 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-08 14:33:52,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,804 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-08 14:33:52,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,821 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-08 14:33:52,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,855 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-08 14:33:52,856 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,864 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,873 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,891 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-08 14:33:52,892 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-01-08 14:33:52,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:52,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, 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 47 [2019-01-08 14:33:52,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:52,974 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-08 14:33:52,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-08 14:33:53,000 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-08 14:33:53,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:53,011 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-08 14:33:53,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:53,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:33:53,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:53,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:33:53,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:33:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:33:53,033 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-01-08 14:33:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:53,162 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-01-08 14:33:53,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:33:53,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:33:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:53,163 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:33:53,163 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 14:33:53,163 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-08 14:33:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 14:33:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-08 14:33:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:33:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-08 14:33:53,174 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-01-08 14:33:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:53,174 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-08 14:33:53,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:33:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-08 14:33:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:33:53,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:53,175 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 14:33:53,175 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-01-08 14:33:53,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:53,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:53,253 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-08 14:33:53,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:53,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:53,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:33:53,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:33:53,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:53,254 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-08 14:33:53,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:33:53,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:33:53,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:33:53,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:33:53,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:53,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,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 31 treesize of output 40 [2019-01-08 14:33:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,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 27 treesize of output 42 [2019-01-08 14:33:53,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,361 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-08 14:33:53,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,405 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 15 treesize of output 18 [2019-01-08 14:33:53,408 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 18 treesize of output 24 [2019-01-08 14:33:53,412 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 20 treesize of output 34 [2019-01-08 14:33:53,434 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 22 treesize of output 45 [2019-01-08 14:33:53,435 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,448 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,486 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-08 14:33:53,487 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:53,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,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, 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-08 14:33:53,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,527 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-08 14:33:53,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:53,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,551 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 57 [2019-01-08 14:33:53,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,573 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-08 14:33:53,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-01-08 14:33:53,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:53,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, 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-08 14:33:53,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:53,627 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-08 14:33:53,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:33:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:33:53,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:53,675 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-08 14:33:53,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:53,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:33:53,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:53,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:33:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:33:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:33:53,697 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-01-08 14:33:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:54,068 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-01-08 14:33:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:33:54,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-08 14:33:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:54,070 INFO L225 Difference]: With dead ends: 65 [2019-01-08 14:33:54,070 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 14:33:54,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:33:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 14:33:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-01-08 14:33:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:33:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-08 14:33:54,083 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-08 14:33:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:54,083 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-08 14:33:54,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:33:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-08 14:33:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:33:54,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:54,084 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 14:33:54,084 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-01-08 14:33:54,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:54,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:33:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:54,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:54,193 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-08 14:33:54,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:54,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:54,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:33:54,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:33:54,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:54,194 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-08 14:33:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:33:54,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:33:54,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:33:54,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:33:54,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:54,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 15 treesize of output 18 [2019-01-08 14:33:54,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 18 treesize of output 24 [2019-01-08 14:33:54,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,238 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 20 treesize of output 34 [2019-01-08 14:33:54,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,246 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 22 treesize of output 45 [2019-01-08 14:33:54,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,303 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-08 14:33:54,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,350 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-08 14:33:54,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,387 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-08 14:33:54,387 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,404 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,414 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,433 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-08 14:33:54,434 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,458 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-08 14:33:54,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,489 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-08 14:33:54,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:54,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,523 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 57 [2019-01-08 14:33:54,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,550 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-08 14:33:54,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-08 14:33:54,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:54,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 33 treesize of output 67 [2019-01-08 14:33:54,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:54,606 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-08 14:33:54,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:33:54,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-08 14:33:54,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:54,713 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-08 14:33:54,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:54,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-08 14:33:54,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:54,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:33:54,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:33:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:33:54,735 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-01-08 14:33:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:55,134 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-01-08 14:33:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:33:55,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-08 14:33:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:55,135 INFO L225 Difference]: With dead ends: 53 [2019-01-08 14:33:55,136 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 14:33:55,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:33:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 14:33:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-01-08 14:33:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:33:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-08 14:33:55,148 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-08 14:33:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:55,148 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-08 14:33:55,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:33:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-08 14:33:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:33:55,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:55,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:33:55,150 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-08 14:33:55,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:55,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:33:55,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:55,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:55,227 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-08 14:33:55,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:55,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:55,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:33:55,229 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-08 14:33:55,230 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:55,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:55,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:55,858 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-08 14:33:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:55,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:55,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:55,858 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-08 14:33:55,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:55,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:55,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:55,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:55,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-08 14:33:55,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:55,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:55,939 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-08 14:33:55,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:55,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:55,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:55,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:55,977 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-08 14:33:55,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:55,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:55,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:56,010 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 15 treesize of output 18 [2019-01-08 14:33:56,013 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 18 treesize of output 24 [2019-01-08 14:33:56,016 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 20 treesize of output 34 [2019-01-08 14:33:56,019 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 22 treesize of output 45 [2019-01-08 14:33:56,020 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:56,034 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:56,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:56,052 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:56,071 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-08 14:33:56,072 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:33:56,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:56,109 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-08 14:33:56,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:56,127 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-08 14:33:56,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:33:56,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:56,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:56,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:56,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:56,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:56,153 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-08 14:33:56,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:56,176 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-08 14:33:56,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:33:56,194 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-08 14:33:56,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:56,226 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-08 14:33:56,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:56,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:33:56,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:56,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:33:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:33:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:33:56,247 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-01-08 14:33:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:56,476 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-01-08 14:33:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:33:56,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:33:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:56,477 INFO L225 Difference]: With dead ends: 54 [2019-01-08 14:33:56,477 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 14:33:56,478 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-08 14:33:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 14:33:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-08 14:33:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 14:33:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-01-08 14:33:56,490 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-01-08 14:33:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:56,490 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-01-08 14:33:56,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:33:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-01-08 14:33:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:33:56,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:56,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:33:56,492 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:56,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-01-08 14:33:56,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:56,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:56,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:56,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:56,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:56,612 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-08 14:33:56,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:56,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:56,613 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:33:56,613 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-08 14:33:56,615 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:56,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:33:57,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:33:57,451 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:33:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:57,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:33:57,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:57,451 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-08 14:33:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:57,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:33:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:57,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:33:57,492 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 15 treesize of output 18 [2019-01-08 14:33:57,497 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 18 treesize of output 24 [2019-01-08 14:33:57,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,507 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 20 treesize of output 34 [2019-01-08 14:33:57,519 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:33:57,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,582 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 17 treesize of output 29 [2019-01-08 14:33:57,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-08 14:33:57,616 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,637 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-08 14:33:57,637 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-08 14:33:57,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,689 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 6 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:33:57,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-08 14:33:57,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-08 14:33:57,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:124 [2019-01-08 14:33:57,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,882 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:33:57,883 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 36 treesize of output 49 [2019-01-08 14:33:57,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:33:57,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-01-08 14:33:57,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:57,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:57,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,001 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 44 [2019-01-08 14:33:58,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:58,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-08 14:33:58,041 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:61 [2019-01-08 14:33:58,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,091 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:33:58,092 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 34 treesize of output 44 [2019-01-08 14:33:58,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:58,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,146 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 34 treesize of output 44 [2019-01-08 14:33:58,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:58,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:33:58,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, 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 54 [2019-01-08 14:33:58,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:33:58,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-08 14:33:58,254 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-01-08 14:33:58,294 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-08 14:33:58,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:33:58,316 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-08 14:33:58,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:33:58,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-01-08 14:33:58,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:33:58,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:33:58,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:33:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:33:58,338 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-01-08 14:33:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:33:59,151 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-01-08 14:33:59,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 14:33:59,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:33:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:33:59,153 INFO L225 Difference]: With dead ends: 81 [2019-01-08 14:33:59,153 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:33:59,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:33:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:33:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-01-08 14:33:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 14:33:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-01-08 14:33:59,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-01-08 14:33:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:33:59,171 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-01-08 14:33:59,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:33:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-01-08 14:33:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:33:59,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:33:59,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:33:59,172 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:33:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:33:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-08 14:33:59,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:33:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:59,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:33:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:33:59,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:33:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:33:59,322 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-08 14:33:59,542 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-08 14:33:59,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:33:59,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:33:59,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:33:59,543 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-08 14:33:59,545 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:33:59,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:00,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:00,353 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:34:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:00,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:00,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:00,354 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-08 14:34:00,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:00,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:00,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:00,389 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 15 treesize of output 18 [2019-01-08 14:34:00,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, 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 24 [2019-01-08 14:34:00,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,398 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 20 treesize of output 34 [2019-01-08 14:34:00,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,408 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 22 treesize of output 45 [2019-01-08 14:34:00,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,479 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-08 14:34:00,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,507 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-08 14:34:00,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,540 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-08 14:34:00,541 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,551 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,559 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,579 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:00,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,623 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-08 14:34:00,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,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-08 14:34:00,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:00,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,677 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:00,678 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-08 14:34:00,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:00,698 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-08 14:34:00,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-01-08 14:34:00,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:00,898 INFO L303 Elim1Store]: Index analysis took 183 ms [2019-01-08 14:34:00,898 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 69 [2019-01-08 14:34:00,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:01,238 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-08 14:34:01,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-08 14:34:01,450 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-08 14:34:01,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:02,153 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-08 14:34:02,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:02,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:34:02,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:02,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:34:02,187 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-01-08 14:34:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:02,826 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-08 14:34:02,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:34:02,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:34:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:02,828 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:34:02,828 INFO L226 Difference]: Without dead ends: 64 [2019-01-08 14:34:02,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:34:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-08 14:34:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-01-08 14:34:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:34:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-08 14:34:02,846 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-08 14:34:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:02,846 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-08 14:34:02,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-08 14:34:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:34:02,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:02,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:34:02,847 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-08 14:34:02,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:02,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:02,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:02,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:02,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:02,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-08 14:34:02,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:02,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:02,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:34:02,938 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-08 14:34:02,939 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:02,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:03,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:03,672 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-08 14:34:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:03,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:03,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:03,673 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-08 14:34:03,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:03,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:03,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:03,747 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-08 14:34:03,864 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-08 14:34:03,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:03,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:03,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, 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-08 14:34:04,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,025 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-08 14:34:04,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,228 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 15 treesize of output 18 [2019-01-08 14:34:04,256 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 18 treesize of output 20 [2019-01-08 14:34:04,294 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 20 treesize of output 30 [2019-01-08 14:34:04,330 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-08 14:34:04,331 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,646 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,672 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-08 14:34:04,673 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:34:04,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,706 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-08 14:34:04,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,716 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-08 14:34:04,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:34:04,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:04,800 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-08 14:34:04,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:04,814 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-08 14:34:04,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-08 14:34:04,827 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-08 14:34:04,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:04,857 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-08 14:34:04,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:04,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:34:04,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:04,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:34:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:34:04,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:34:04,879 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-01-08 14:34:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:05,149 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-01-08 14:34:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:34:05,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:34:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:05,151 INFO L225 Difference]: With dead ends: 62 [2019-01-08 14:34:05,152 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 14:34:05,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 14:34:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-08 14:34:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:34:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-01-08 14:34:05,165 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-01-08 14:34:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:05,165 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-01-08 14:34:05,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:34:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-01-08 14:34:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:34:05,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:05,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:34:05,167 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-08 14:34:05,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:05,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:05,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:05,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:05,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:05,260 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-08 14:34:05,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:34:05,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:34:05,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:34:05,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:34:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:34:05,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:34:05,262 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-01-08 14:34:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:05,322 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-01-08 14:34:05,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:34:05,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:34:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:05,324 INFO L225 Difference]: With dead ends: 51 [2019-01-08 14:34:05,324 INFO L226 Difference]: Without dead ends: 46 [2019-01-08 14:34:05,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:34:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-08 14:34:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-08 14:34:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:34:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-01-08 14:34:05,341 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-01-08 14:34:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:05,341 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-01-08 14:34:05,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:34:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-01-08 14:34:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:34:05,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:05,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:34:05,342 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-01-08 14:34:05,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:05,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:05,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:05,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:05,605 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-08 14:34:05,653 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-08 14:34:05,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:05,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:05,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:05,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:05,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:05,654 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-08 14:34:05,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:05,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:05,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:34:05,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:05,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:05,687 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 15 treesize of output 18 [2019-01-08 14:34:05,691 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 18 treesize of output 24 [2019-01-08 14:34:05,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,698 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 20 treesize of output 34 [2019-01-08 14:34:05,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,738 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 22 treesize of output 45 [2019-01-08 14:34:05,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,798 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-08 14:34:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,826 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-08 14:34:05,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,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-08 14:34:05,860 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,870 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,877 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,924 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-08 14:34:05,924 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:05,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,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, 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-08 14:34:05,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:05,966 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-08 14:34:05,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:05,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:05,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 31 treesize of output 65 [2019-01-08 14:34:05,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:06,017 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-08 14:34:06,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:34:06,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:06,046 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:06,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, 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-08 14:34:06,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:06,115 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-08 14:34:06,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:06,132 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-08 14:34:06,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:06,162 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-08 14:34:06,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:06,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:34:06,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:06,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:06,183 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-01-08 14:34:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:06,959 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-01-08 14:34:06,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:06,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:34:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:06,961 INFO L225 Difference]: With dead ends: 90 [2019-01-08 14:34:06,961 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 14:34:06,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:34:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 14:34:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-01-08 14:34:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:34:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-01-08 14:34:06,986 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-01-08 14:34:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:06,986 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-01-08 14:34:06,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-01-08 14:34:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:34:06,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:06,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:34:06,988 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-08 14:34:06,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:06,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:06,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:06,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:06,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:07,075 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-08 14:34:07,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:07,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:07,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:34:07,076 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-08 14:34:07,077 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:07,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:07,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:07,401 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-08 14:34:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:07,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:07,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:07,402 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-08 14:34:07,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:07,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:07,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:07,438 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 15 treesize of output 18 [2019-01-08 14:34:07,442 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 18 treesize of output 24 [2019-01-08 14:34:07,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,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 20 treesize of output 34 [2019-01-08 14:34:07,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,465 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 22 treesize of output 45 [2019-01-08 14:34:07,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,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, 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-08 14:34:07,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,562 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-08 14:34:07,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,617 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-08 14:34:07,617 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,627 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,654 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-08 14:34:07,655 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:07,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,677 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-08 14:34:07,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,697 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-08 14:34:07,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:07,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:07,721 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-08 14:34:07,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:07,744 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-08 14:34:07,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:34:07,877 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-08 14:34:07,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:07,932 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-08 14:34:07,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:07,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:34:07,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:07,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:34:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:34:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:34:07,953 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-01-08 14:34:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:08,124 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-01-08 14:34:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:34:08,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:34:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:08,125 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:34:08,125 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 14:34:08,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 14:34:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-08 14:34:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 14:34:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-01-08 14:34:08,153 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-01-08 14:34:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:08,153 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-01-08 14:34:08,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:34:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-01-08 14:34:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:34:08,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:08,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:34:08,154 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-08 14:34:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:08,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:08,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:08,213 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-08 14:34:08,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:08,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:08,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:34:08,214 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-08 14:34:08,215 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:08,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:08,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:08,428 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-08 14:34:08,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:08,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:08,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:08,429 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-08 14:34:08,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:08,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:08,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:08,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,470 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-08 14:34:08,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,510 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-08 14:34:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,544 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-08 14:34:08,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,581 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 15 treesize of output 18 [2019-01-08 14:34:08,584 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 18 treesize of output 24 [2019-01-08 14:34:08,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:34:08,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:08,588 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,604 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,642 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-08 14:34:08,642 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:08,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,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, 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-08 14:34:08,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,950 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-08 14:34:08,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:08,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:08,972 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:08,973 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 53 [2019-01-08 14:34:08,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:08,993 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-08 14:34:08,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-08 14:34:09,010 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-08 14:34:09,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:34:09,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:09,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:34:09,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:09,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:34:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:34:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:34:09,051 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-01-08 14:34:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:09,285 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-01-08 14:34:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:34:09,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-08 14:34:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:09,287 INFO L225 Difference]: With dead ends: 63 [2019-01-08 14:34:09,287 INFO L226 Difference]: Without dead ends: 62 [2019-01-08 14:34:09,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:34:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-08 14:34:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-08 14:34:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 14:34:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-01-08 14:34:09,308 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-01-08 14:34:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:09,308 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-01-08 14:34:09,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:34:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-01-08 14:34:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:34:09,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:09,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:34:09,309 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-08 14:34:09,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:09,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:09,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:09,372 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-08 14:34:09,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:09,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:09,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:09,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:09,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:09,372 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-08 14:34:09,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:09,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:09,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:34:09,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:09,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:09,409 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 15 treesize of output 18 [2019-01-08 14:34:09,415 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 18 treesize of output 24 [2019-01-08 14:34:09,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,424 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 20 treesize of output 34 [2019-01-08 14:34:09,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:09,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,491 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-08 14:34:09,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,519 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-08 14:34:09,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,553 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-08 14:34:09,554 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,563 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,572 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,592 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-08 14:34:09,593 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:09,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,612 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-08 14:34:09,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,631 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-08 14:34:09,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:09,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:09,654 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-08 14:34:09,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:09,675 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-08 14:34:09,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:09,690 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-08 14:34:09,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:09,710 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-08 14:34:09,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:09,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:34:09,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:09,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:34:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:34:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:09,732 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-01-08 14:34:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:09,944 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-01-08 14:34:09,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:34:09,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:34:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:09,946 INFO L225 Difference]: With dead ends: 86 [2019-01-08 14:34:09,946 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:34:09,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-08 14:34:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:34:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-01-08 14:34:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:34:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-01-08 14:34:09,971 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-01-08 14:34:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:09,972 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-01-08 14:34:09,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:34:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-01-08 14:34:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:09,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:09,973 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-08 14:34:09,973 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-01-08 14:34:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:09,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:09,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:10,061 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-08 14:34:10,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:10,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:10,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:10,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:10,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:10,062 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-08 14:34:10,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:34:10,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:34:10,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:34:10,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:10,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:10,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,097 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-08 14:34:10,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,130 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-08 14:34:10,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,165 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-08 14:34:10,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,202 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 15 treesize of output 18 [2019-01-08 14:34:10,205 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 18 treesize of output 24 [2019-01-08 14:34:10,208 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 20 treesize of output 34 [2019-01-08 14:34:10,211 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 22 treesize of output 45 [2019-01-08 14:34:10,211 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,237 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,265 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-08 14:34:10,266 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:10,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,288 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-08 14:34:10,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,305 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-08 14:34:10,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:10,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,329 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 57 [2019-01-08 14:34:10,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,352 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-08 14:34:10,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-08 14:34:10,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,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, 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-08 14:34:10,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,401 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-08 14:34:10,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:10,429 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-08 14:34:10,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:10,458 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-08 14:34:10,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:34:10,474 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-08 14:34:10,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:10,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-08 14:34:10,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:10,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-08 14:34:10,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:10,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:34:10,542 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-01-08 14:34:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:11,013 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-01-08 14:34:11,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:11,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:34:11,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:11,015 INFO L225 Difference]: With dead ends: 96 [2019-01-08 14:34:11,015 INFO L226 Difference]: Without dead ends: 90 [2019-01-08 14:34:11,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-08 14:34:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-01-08 14:34:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-08 14:34:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-01-08 14:34:11,042 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-01-08 14:34:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:11,042 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-01-08 14:34:11,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-01-08 14:34:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:11,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:11,043 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:34:11,043 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-01-08 14:34:11,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:11,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:11,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:11,243 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-08 14:34:11,263 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-08 14:34:11,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:11,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:11,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:11,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:11,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:11,264 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-08 14:34:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:34:11,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:34:11,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:34:11,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:11,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:11,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,302 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-08 14:34:11,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,338 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-08 14:34:11,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,403 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-08 14:34:11,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,439 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 15 treesize of output 18 [2019-01-08 14:34:11,442 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 18 treesize of output 24 [2019-01-08 14:34:11,444 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 20 treesize of output 34 [2019-01-08 14:34:11,447 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 22 treesize of output 45 [2019-01-08 14:34:11,447 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,463 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,472 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,500 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-08 14:34:11,500 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:11,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,523 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-08 14:34:11,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,542 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-08 14:34:11,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:11,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,571 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 57 [2019-01-08 14:34:11,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,593 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-08 14:34:11,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-08 14:34:11,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,652 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-08 14:34:11,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,674 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-08 14:34:11,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:11,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:11,776 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-08 14:34:11,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:11,804 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-08 14:34:11,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-08 14:34:11,824 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-08 14:34:11,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:11,915 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-08 14:34:11,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:11,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:34:11,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:11,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:34:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:34:11,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:11,937 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-01-08 14:34:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:12,397 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-01-08 14:34:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:12,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:34:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:12,399 INFO L225 Difference]: With dead ends: 107 [2019-01-08 14:34:12,399 INFO L226 Difference]: Without dead ends: 106 [2019-01-08 14:34:12,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:34:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-08 14:34:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-01-08 14:34:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 14:34:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-01-08 14:34:12,432 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-01-08 14:34:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:12,433 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-01-08 14:34:12,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:34:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-01-08 14:34:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:12,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:12,434 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:34:12,434 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-01-08 14:34:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:12,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:12,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:12,584 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-08 14:34:12,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:12,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:12,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:12,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:12,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:12,585 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-08 14:34:12,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:12,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:12,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:12,622 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 15 treesize of output 18 [2019-01-08 14:34:12,626 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 18 treesize of output 24 [2019-01-08 14:34:12,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,634 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 20 treesize of output 34 [2019-01-08 14:34:12,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,647 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 22 treesize of output 45 [2019-01-08 14:34:12,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,735 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-08 14:34:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,780 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-08 14:34:12,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,819 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-08 14:34:12,820 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,831 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,840 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,863 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-08 14:34:12,864 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:12,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,895 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-08 14:34:12,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,918 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-08 14:34:12,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:12,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:12,953 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-08 14:34:12,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:12,977 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-08 14:34:12,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:12,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,016 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-08 14:34:13,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:13,050 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-08 14:34:13,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-01-08 14:34:13,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:13,093 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-08 14:34:13,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:13,126 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-08 14:34:13,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-08 14:34:13,149 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-08 14:34:13,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:13,210 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-08 14:34:13,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:13,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:34:13,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:13,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:34:13,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:34:13,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:13,234 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-01-08 14:34:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:13,712 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-01-08 14:34:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:13,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:34:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:13,715 INFO L225 Difference]: With dead ends: 116 [2019-01-08 14:34:13,715 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 14:34:13,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 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-08 14:34:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 14:34:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-01-08 14:34:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:34:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-01-08 14:34:13,744 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-01-08 14:34:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:13,744 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-01-08 14:34:13,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:34:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-01-08 14:34:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:13,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:13,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:13,745 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-08 14:34:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:13,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:13,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:13,909 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-08 14:34:14,046 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-08 14:34:14,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:14,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:14,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:14,047 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-08 14:34:14,048 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:14,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:14,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:14,642 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-08 14:34:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:14,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:14,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:14,643 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-08 14:34:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:14,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:14,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:14,681 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 15 treesize of output 18 [2019-01-08 14:34:14,684 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 18 treesize of output 24 [2019-01-08 14:34:14,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,693 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 20 treesize of output 34 [2019-01-08 14:34:14,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,702 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 22 treesize of output 45 [2019-01-08 14:34:14,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,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 31 treesize of output 40 [2019-01-08 14:34:14,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,801 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-08 14:34:14,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,835 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-08 14:34:14,835 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,873 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-08 14:34:14,874 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:14,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,899 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-08 14:34:14,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,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-08 14:34:14,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:14,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:14,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, 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-08 14:34:14,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:14,963 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-08 14:34:14,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:34:14,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:15,000 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-08 14:34:15,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:15,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:34:15,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:15,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:34:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:34:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:34:15,022 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-01-08 14:34:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:15,299 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-01-08 14:34:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:34:15,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:34:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:15,301 INFO L225 Difference]: With dead ends: 72 [2019-01-08 14:34:15,301 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:34:15,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:34:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-01-08 14:34:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 14:34:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-01-08 14:34:15,334 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-01-08 14:34:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:15,335 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-01-08 14:34:15,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:34:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-01-08 14:34:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:15,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:15,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:15,336 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-08 14:34:15,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:15,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:15,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:15,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:15,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:15,418 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-08 14:34:15,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:15,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:15,418 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:15,418 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-08 14:34:15,419 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:15,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:16,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:16,071 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-08 14:34:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:16,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:16,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:16,071 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-08 14:34:16,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:16,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:16,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:16,118 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 15 treesize of output 18 [2019-01-08 14:34:16,123 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 18 treesize of output 24 [2019-01-08 14:34:16,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,130 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 20 treesize of output 34 [2019-01-08 14:34:16,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:16,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,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, 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-08 14:34:16,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,237 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-08 14:34:16,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,275 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-08 14:34:16,276 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,309 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-08 14:34:16,310 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:16,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,332 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-08 14:34:16,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,351 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-08 14:34:16,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,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, 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-08 14:34:16,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,401 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-08 14:34:16,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:16,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:16,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:16,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 33 treesize of output 72 [2019-01-08 14:34:16,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:16,455 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-08 14:34:16,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:34:16,475 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-08 14:34:16,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:16,520 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-08 14:34:16,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:16,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:34:16,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:16,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:16,542 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-01-08 14:34:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:16,942 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-01-08 14:34:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:16,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:34:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:16,944 INFO L225 Difference]: With dead ends: 77 [2019-01-08 14:34:16,944 INFO L226 Difference]: Without dead ends: 76 [2019-01-08 14:34:16,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-08 14:34:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-08 14:34:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 14:34:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-01-08 14:34:16,978 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-01-08 14:34:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:16,978 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-01-08 14:34:16,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-01-08 14:34:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:16,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:16,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:16,979 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:16,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:16,979 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-08 14:34:16,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:16,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:16,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:16,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:16,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:17,103 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-08 14:34:17,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:17,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:17,104 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:17,105 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-08 14:34:17,106 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:17,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:17,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:17,873 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-08 14:34:17,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:17,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:17,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:17,873 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-08 14:34:17,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:17,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:17,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:17,913 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 15 treesize of output 18 [2019-01-08 14:34:17,919 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 18 treesize of output 24 [2019-01-08 14:34:17,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:17,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:17,925 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 20 treesize of output 34 [2019-01-08 14:34:17,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:17,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:17,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:17,937 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 22 treesize of output 45 [2019-01-08 14:34:17,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:17,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:17,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:17,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,014 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-08 14:34:18,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,056 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-08 14:34:18,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,089 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-08 14:34:18,089 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,099 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,107 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,126 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:18,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,168 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-08 14:34:18,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,185 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-08 14:34:18,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:18,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,212 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-08 14:34:18,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,286 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-08 14:34:18,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:18,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:18,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:18,351 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-08 14:34:18,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:18,377 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-08 14:34:18,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:18,395 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-08 14:34:18,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:18,431 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-08 14:34:18,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:18,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:34:18,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:18,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:34:18,452 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-01-08 14:34:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:18,804 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-01-08 14:34:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:34:18,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:34:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:18,806 INFO L225 Difference]: With dead ends: 78 [2019-01-08 14:34:18,807 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 14:34:18,807 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-08 14:34:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 14:34:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-01-08 14:34:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 14:34:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-01-08 14:34:18,844 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-01-08 14:34:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:18,844 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-01-08 14:34:18,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-01-08 14:34:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:18,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:18,845 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:34:18,845 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-01-08 14:34:18,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:18,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:18,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:19,043 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-08 14:34:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:19,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:19,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:19,044 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-08 14:34:19,045 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:19,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:19,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:19,773 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:34:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:19,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:19,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:19,774 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-08 14:34:19,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:19,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:19,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:19,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:19,818 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-08 14:34:19,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:19,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:19,859 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-08 14:34:19,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:19,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:19,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:19,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:19,892 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-08 14:34:19,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:19,903 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:19,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:19,928 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 15 treesize of output 18 [2019-01-08 14:34:19,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:34:19,934 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 20 treesize of output 34 [2019-01-08 14:34:19,936 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 22 treesize of output 45 [2019-01-08 14:34:19,937 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:19,952 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:19,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:19,968 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:19,987 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-08 14:34:19,987 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:20,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,015 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-08 14:34:20,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:20,032 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-08 14:34:20,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:20,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,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 67 [2019-01-08 14:34:20,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:20,084 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-08 14:34:20,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:20,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,118 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-08 14:34:20,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:20,146 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-08 14:34:20,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:34:20,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:20,185 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:20,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 33 treesize of output 73 [2019-01-08 14:34:20,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:20,212 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-08 14:34:20,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:20,231 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-08 14:34:20,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:34:20,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:20,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:34:20,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:20,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:34:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:34:20,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:20,301 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-01-08 14:34:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:20,794 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-01-08 14:34:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:20,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:34:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:20,796 INFO L225 Difference]: With dead ends: 95 [2019-01-08 14:34:20,796 INFO L226 Difference]: Without dead ends: 90 [2019-01-08 14:34:20,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:34:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-08 14:34:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-08 14:34:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:34:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-01-08 14:34:20,828 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-01-08 14:34:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:20,828 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-01-08 14:34:20,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:34:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-01-08 14:34:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:20,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:20,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:20,829 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-08 14:34:20,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:20,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:20,965 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-08 14:34:20,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:20,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:20,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:20,966 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-08 14:34:20,967 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:20,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:21,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:21,303 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-08 14:34:21,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:21,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:21,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:21,303 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-08 14:34:21,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:21,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:21,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:21,357 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 15 treesize of output 18 [2019-01-08 14:34:21,360 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 18 treesize of output 24 [2019-01-08 14:34:21,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:34:21,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,380 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 22 treesize of output 45 [2019-01-08 14:34:21,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,443 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-08 14:34:21,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,468 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-08 14:34:21,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,502 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-08 14:34:21,502 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,512 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,521 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,540 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-08 14:34:21,541 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:21,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,564 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-08 14:34:21,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,582 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-08 14:34:21,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:21,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:21,608 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-08 14:34:21,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:21,629 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-08 14:34:21,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-08 14:34:21,648 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-08 14:34:21,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:21,665 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-08 14:34:21,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:21,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-08 14:34:21,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:21,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:34:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:34:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:21,686 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-01-08 14:34:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:22,573 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-01-08 14:34:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:34:22,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:34:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:22,575 INFO L225 Difference]: With dead ends: 90 [2019-01-08 14:34:22,575 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 14:34:22,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:34:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 14:34:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-01-08 14:34:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-08 14:34:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-01-08 14:34:22,619 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-01-08 14:34:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:22,619 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-01-08 14:34:22,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:34:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-01-08 14:34:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:22,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:22,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:22,620 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-08 14:34:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:22,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:22,736 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-08 14:34:22,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:22,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:22,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:22,737 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-08 14:34:22,738 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:22,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:23,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:23,047 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-08 14:34:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:23,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:23,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:23,048 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-08 14:34:23,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:23,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:23,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:23,077 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 15 treesize of output 18 [2019-01-08 14:34:23,079 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 18 treesize of output 24 [2019-01-08 14:34:23,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,088 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 20 treesize of output 34 [2019-01-08 14:34:23,100 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:34:23,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,171 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 17 treesize of output 29 [2019-01-08 14:34:23,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-08 14:34:23,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,213 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-08 14:34:23,213 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-08 14:34:23,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,244 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-08 14:34:23,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,254 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-08 14:34:23,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:34:23,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:23,274 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:23,275 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 36 [2019-01-08 14:34:23,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:23,286 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-08 14:34:23,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-08 14:34:24,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:24,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:24,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:24,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:24,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:24,391 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-08 14:34:24,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:24,405 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-08 14:34:24,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-08 14:34:24,419 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-08 14:34:24,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:24,462 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-08 14:34:24,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:24,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:34:24,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:24,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:24,481 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-01-08 14:34:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:24,954 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-01-08 14:34:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:24,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:34:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:24,957 INFO L225 Difference]: With dead ends: 122 [2019-01-08 14:34:24,957 INFO L226 Difference]: Without dead ends: 121 [2019-01-08 14:34:24,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-08 14:34:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-01-08 14:34:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-08 14:34:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-01-08 14:34:25,009 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-01-08 14:34:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-01-08 14:34:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-01-08 14:34:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:25,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:25,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:25,011 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-08 14:34:25,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:25,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:25,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:25,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:25,107 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-08 14:34:25,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:25,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:25,107 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:25,107 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-08 14:34:25,108 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:25,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:25,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:25,609 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-08 14:34:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:25,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:25,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:25,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 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-08 14:34:25,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:25,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:25,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:25,627 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-08 14:34:25,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,649 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-08 14:34:25,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,693 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-08 14:34:25,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,731 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 15 treesize of output 18 [2019-01-08 14:34:25,735 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 18 treesize of output 20 [2019-01-08 14:34:25,742 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 20 treesize of output 30 [2019-01-08 14:34:25,745 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-08 14:34:25,746 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,760 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,794 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-08 14:34:25,795 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:34:25,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:34:25,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,839 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-08 14:34:25,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:34:25,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:25,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:25,859 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-08 14:34:25,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:25,874 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-08 14:34:25,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:34:25,891 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-08 14:34:25,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:25,914 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-08 14:34:25,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:25,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:34:25,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:25,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:34:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:34:25,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:25,936 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-01-08 14:34:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:26,187 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-01-08 14:34:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:34:26,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:34:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:26,189 INFO L225 Difference]: With dead ends: 113 [2019-01-08 14:34:26,189 INFO L226 Difference]: Without dead ends: 108 [2019-01-08 14:34:26,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-08 14:34:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-08 14:34:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 14:34:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-01-08 14:34:26,258 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-01-08 14:34:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:26,258 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-01-08 14:34:26,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:34:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-01-08 14:34:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:26,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:26,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:26,259 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:26,260 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-08 14:34:26,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:26,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:26,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:26,558 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-08 14:34:26,637 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-08 14:34:26,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:26,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:26,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:26,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:26,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:26,639 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-08 14:34:26,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:26,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:26,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:34:26,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:26,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:26,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,671 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-08 14:34:26,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,700 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-08 14:34:26,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,734 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-08 14:34:26,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,770 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 15 treesize of output 18 [2019-01-08 14:34:26,772 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 18 treesize of output 24 [2019-01-08 14:34:26,774 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 20 treesize of output 34 [2019-01-08 14:34:26,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:26,777 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,915 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-08 14:34:26,916 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:26,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,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 31 treesize of output 51 [2019-01-08 14:34:26,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:26,962 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-08 14:34:26,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:26,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:26,987 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-08 14:34:26,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:27,006 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-08 14:34:27,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:27,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:27,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:27,036 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 71 [2019-01-08 14:34:27,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:27,059 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-08 14:34:27,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:34:27,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:27,111 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-08 14:34:27,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:27,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:34:27,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:27,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:34:27,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:34:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:27,132 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-01-08 14:34:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:27,501 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-01-08 14:34:27,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:34:27,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:34:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:27,503 INFO L225 Difference]: With dead ends: 137 [2019-01-08 14:34:27,504 INFO L226 Difference]: Without dead ends: 136 [2019-01-08 14:34:27,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:34:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-08 14:34:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-08 14:34:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 14:34:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-01-08 14:34:27,557 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-01-08 14:34:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:27,557 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-01-08 14:34:27,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:34:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-01-08 14:34:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:27,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:27,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:27,558 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-08 14:34:27,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:27,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:27,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:27,873 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-08 14:34:27,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:27,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:27,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:27,874 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-08 14:34:27,875 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:27,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:28,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:28,607 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-08 14:34:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:28,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:28,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:28,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 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-08 14:34:28,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:28,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:28,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:28,625 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 14 treesize of output 17 [2019-01-08 14:34:28,629 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 17 treesize of output 19 [2019-01-08 14:34:28,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-01-08 14:34:28,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,684 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 15 treesize of output 18 [2019-01-08 14:34:28,689 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 18 treesize of output 20 [2019-01-08 14:34:28,697 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 20 treesize of output 22 [2019-01-08 14:34:28,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:34:28,707 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,747 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-08 14:34:28,747 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-01-08 14:34:28,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,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, 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 21 [2019-01-08 14:34:28,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-08 14:34:28,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:28,885 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 21 treesize of output 27 [2019-01-08 14:34:28,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:28,893 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-08 14:34:28,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-08 14:34:28,906 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-08 14:34:28,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:28,926 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-08 14:34:28,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:28,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:34:28,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:28,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:34:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:34:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:28,948 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-01-08 14:34:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:29,171 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-01-08 14:34:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:34:29,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:34:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:29,174 INFO L225 Difference]: With dead ends: 110 [2019-01-08 14:34:29,174 INFO L226 Difference]: Without dead ends: 109 [2019-01-08 14:34:29,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:34:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-08 14:34:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-01-08 14:34:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-08 14:34:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-01-08 14:34:29,228 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-01-08 14:34:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:29,228 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-01-08 14:34:29,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:34:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-01-08 14:34:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:29,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:29,229 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:34:29,229 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-01-08 14:34:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:29,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:29,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:29,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:29,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:34:29,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:29,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:29,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:29,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:29,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:29,772 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-08 14:34:29,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:29,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:29,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:34:29,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:29,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:29,982 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-08 14:34:29,985 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 15 treesize of output 18 [2019-01-08 14:34:29,988 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 18 treesize of output 24 [2019-01-08 14:34:29,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:29,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:29,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:34:29,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:29,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:29,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:29,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:29,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,058 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-08 14:34:30,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,086 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-08 14:34:30,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,117 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-08 14:34:30,118 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,128 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,136 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,155 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-08 14:34:30,155 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:30,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,177 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-08 14:34:30,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,194 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-08 14:34:30,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:30,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,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 31 treesize of output 57 [2019-01-08 14:34:30,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,242 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-08 14:34:30,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:34:30,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,270 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:30,270 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-08 14:34:30,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,294 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-08 14:34:30,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:30,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:30,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, 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-08 14:34:30,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:30,349 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-08 14:34:30,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:34:30,367 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-08 14:34:30,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:30,409 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-08 14:34:30,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:30,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:34:30,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:30,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:34:30,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:34:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:34:30,429 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-01-08 14:34:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:30,872 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-01-08 14:34:30,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:30,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:34:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:30,874 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:34:30,874 INFO L226 Difference]: Without dead ends: 116 [2019-01-08 14:34:30,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:34:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-08 14:34:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-01-08 14:34:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 14:34:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-01-08 14:34:30,933 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-01-08 14:34:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:30,933 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-01-08 14:34:30,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:34:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-01-08 14:34:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:30,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:30,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:30,935 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:30,935 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-01-08 14:34:30,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:30,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:30,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:30,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:30,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:31,110 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-08 14:34:31,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:31,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:31,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:34:31,111 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-08 14:34:31,112 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:31,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:31,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:31,955 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-08 14:34:31,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:31,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:31,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:31,956 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-08 14:34:31,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:31,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:31,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:34:31,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, 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 24 [2019-01-08 14:34:32,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,009 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 20 treesize of output 34 [2019-01-08 14:34:32,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,020 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 22 treesize of output 45 [2019-01-08 14:34:32,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,085 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-08 14:34:32,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,114 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-08 14:34:32,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,181 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-08 14:34:32,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,218 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:32,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,247 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-08 14:34:32,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,267 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-08 14:34:32,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:32,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,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 31 treesize of output 57 [2019-01-08 14:34:32,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,322 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-08 14:34:32,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-08 14:34:32,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,352 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:32,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,354 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-08 14:34:32,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,379 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-08 14:34:32,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:34:32,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:32,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:32,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 35 treesize of output 75 [2019-01-08 14:34:32,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:32,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-08 14:34:32,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-08 14:34:32,463 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-08 14:34:32,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:32,509 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-08 14:34:32,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:32,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:34:32,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:32,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:34:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:34:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:32,529 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-01-08 14:34:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:33,121 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-01-08 14:34:33,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:33,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:34:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:33,123 INFO L225 Difference]: With dead ends: 137 [2019-01-08 14:34:33,123 INFO L226 Difference]: Without dead ends: 136 [2019-01-08 14:34:33,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:34:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-08 14:34:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-01-08 14:34:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 14:34:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-01-08 14:34:33,189 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-01-08 14:34:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:33,189 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-01-08 14:34:33,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:34:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-01-08 14:34:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:33,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:33,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:33,190 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:33,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-01-08 14:34:33,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:33,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:33,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:33,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:33,356 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-08 14:34:33,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:33,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:33,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:33,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:33,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:33,357 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-08 14:34:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:33,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:33,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:34:33,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:33,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:33,391 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 15 treesize of output 18 [2019-01-08 14:34:33,395 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 18 treesize of output 24 [2019-01-08 14:34:33,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,399 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 20 treesize of output 34 [2019-01-08 14:34:33,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,405 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 22 treesize of output 45 [2019-01-08 14:34:33,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,462 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-08 14:34:33,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,539 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-08 14:34:33,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,570 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-08 14:34:33,571 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,589 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,607 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:33,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,637 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-08 14:34:33,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,655 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-08 14:34:33,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:33,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,696 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:33,697 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-08 14:34:33,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,717 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-08 14:34:33,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-08 14:34:33,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,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, 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-08 14:34:33,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,770 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-08 14:34:33,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-08 14:34:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,800 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:33,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:33,802 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-08 14:34:33,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:33,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-08 14:34:33,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-08 14:34:33,847 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-08 14:34:33,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:33,908 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-08 14:34:33,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:33,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:34:33,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:33,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:34:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:34:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:33,929 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-01-08 14:34:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:34,614 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-01-08 14:34:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:34,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:34:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:34,617 INFO L225 Difference]: With dead ends: 172 [2019-01-08 14:34:34,617 INFO L226 Difference]: Without dead ends: 167 [2019-01-08 14:34:34,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:34:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-08 14:34:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-01-08 14:34:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-08 14:34:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-01-08 14:34:34,719 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-01-08 14:34:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:34,719 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-01-08 14:34:34,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:34:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-01-08 14:34:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:34:34,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:34,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:34:34,720 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:34,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-01-08 14:34:34,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:34,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:34,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:34,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:34,878 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-08 14:34:34,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:34,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:34,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:34,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:34,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:34,879 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-08 14:34:34,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:34:34,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:34:34,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:34:34,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:34,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:34,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:34,914 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-08 14:34:34,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:34,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:34,937 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-08 14:34:35,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,010 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-08 14:34:35,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:34:35,045 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 18 treesize of output 24 [2019-01-08 14:34:35,047 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 20 treesize of output 34 [2019-01-08 14:34:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:35,050 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,065 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,099 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:35,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,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, 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-08 14:34:35,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,144 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-08 14:34:35,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:35,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,172 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:35,173 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-08 14:34:35,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,193 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-08 14:34:35,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-08 14:34:35,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,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 31 treesize of output 65 [2019-01-08 14:34:35,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,243 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-08 14:34:35,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-08 14:34:35,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:35,271 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:35,271 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-08 14:34:35,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:35,295 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-08 14:34:35,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-01-08 14:34:35,311 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-08 14:34:35,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:35,366 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-08 14:34:35,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:35,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:34:35,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:35,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:34:35,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:34:35,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:34:35,385 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-01-08 14:34:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:35,829 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-01-08 14:34:35,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:35,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:34:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:35,832 INFO L225 Difference]: With dead ends: 140 [2019-01-08 14:34:35,832 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 14:34:35,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:34:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 14:34:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-01-08 14:34:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-08 14:34:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-01-08 14:34:35,876 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-01-08 14:34:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:35,877 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-01-08 14:34:35,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:34:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-01-08 14:34:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:35,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:35,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:35,878 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-08 14:34:35,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:35,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:35,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:35,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:35,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:36,027 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-08 14:34:36,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:36,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:36,028 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:34:36,028 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-08 14:34:36,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:36,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:36,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:36,700 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:34:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:36,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:36,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:36,701 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-08 14:34:36,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:36,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:36,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:36,869 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-08 14:34:36,884 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 15 treesize of output 18 [2019-01-08 14:34:36,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 18 treesize of output 24 [2019-01-08 14:34:36,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:36,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:36,962 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 20 treesize of output 34 [2019-01-08 14:34:37,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:37,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,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, 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-08 14:34:37,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,456 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-08 14:34:37,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,491 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-08 14:34:37,491 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,529 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:37,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,558 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-08 14:34:37,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,577 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-08 14:34:37,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,609 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-08 14:34:37,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,631 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-08 14:34:37,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:37,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,663 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:37,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:37,665 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-08 14:34:37,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:37,689 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-08 14:34:37,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-08 14:34:37,709 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-08 14:34:37,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:37,745 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-08 14:34:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:34:37,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:37,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:37,766 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-01-08 14:34:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:38,294 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-01-08 14:34:38,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:38,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:34:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:38,296 INFO L225 Difference]: With dead ends: 77 [2019-01-08 14:34:38,296 INFO L226 Difference]: Without dead ends: 76 [2019-01-08 14:34:38,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:34:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-08 14:34:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-01-08 14:34:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-08 14:34:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-01-08 14:34:38,360 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-01-08 14:34:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:38,360 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-01-08 14:34:38,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-01-08 14:34:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:38,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:38,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:38,361 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:38,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-08 14:34:38,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:38,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:38,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:38,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:38,500 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-08 14:34:38,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:38,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:38,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:34:38,501 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-08 14:34:38,503 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:38,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:39,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:39,525 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-08 14:34:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:39,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:39,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:39,525 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-08 14:34:39,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:39,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:39,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:39,559 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 15 treesize of output 18 [2019-01-08 14:34:39,561 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 18 treesize of output 24 [2019-01-08 14:34:39,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,567 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 20 treesize of output 34 [2019-01-08 14:34:39,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,577 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 22 treesize of output 45 [2019-01-08 14:34:39,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,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-08 14:34:39,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,698 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-08 14:34:39,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,730 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-08 14:34:39,731 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,748 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,766 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:39,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,790 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-08 14:34:39,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,807 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-08 14:34:39,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:39,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,833 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-08 14:34:39,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,854 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-08 14:34:39,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:39,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,882 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:39,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, 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-08 14:34:39,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,907 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-08 14:34:39,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:39,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,934 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:39,936 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-08 14:34:39,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:39,959 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-08 14:34:39,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-08 14:34:39,980 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-08 14:34:39,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:40,025 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-08 14:34:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:40,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:34:40,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:40,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:34:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:34:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:40,045 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-01-08 14:34:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:40,572 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-01-08 14:34:40,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:40,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:34:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:40,573 INFO L225 Difference]: With dead ends: 86 [2019-01-08 14:34:40,574 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:34:40,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:34:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:34:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-01-08 14:34:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 14:34:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-01-08 14:34:40,666 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-01-08 14:34:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:40,666 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-01-08 14:34:40,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:34:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-01-08 14:34:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:40,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:40,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:40,667 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-01-08 14:34:40,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:40,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:40,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:40,746 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-08 14:34:40,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:40,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:40,747 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:34:40,747 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-01-08 14:34:40,748 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:40,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:41,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:41,557 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-08 14:34:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:41,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:41,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:41,558 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-08 14:34:41,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:41,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:41,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:41,610 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 15 treesize of output 18 [2019-01-08 14:34:41,648 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 18 treesize of output 20 [2019-01-08 14:34:41,688 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 20 treesize of output 22 [2019-01-08 14:34:41,698 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-08 14:34:41,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:41,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:41,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:41,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:41,726 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-08 14:34:41,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-01-08 14:34:41,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:41,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-01-08 14:34:41,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:34:41,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-08 14:34:41,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-01-08 14:34:41,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:41,782 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-08 14:34:41,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:41,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:41,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:41,795 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:41,796 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 23 treesize of output 28 [2019-01-08 14:34:41,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:41,807 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-08 14:34:41,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-01-08 14:34:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:34:41,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:41,837 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-08 14:34:41,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:34:41,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-01-08 14:34:41,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:34:41,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:34:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:34:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:41,858 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-01-08 14:34:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:42,092 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-01-08 14:34:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:34:42,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-08 14:34:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:42,093 INFO L225 Difference]: With dead ends: 115 [2019-01-08 14:34:42,093 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 14:34:42,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:34:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 14:34:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-01-08 14:34:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 14:34:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-01-08 14:34:42,223 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-01-08 14:34:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:42,223 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-01-08 14:34:42,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:34:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-01-08 14:34:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:42,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:42,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:42,224 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-08 14:34:42,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:42,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:42,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:42,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:42,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:42,389 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-08 14:34:42,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:42,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:42,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:42,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:42,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:42,391 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-08 14:34:42,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:42,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:42,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:34:42,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:42,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:42,431 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 15 treesize of output 18 [2019-01-08 14:34:42,433 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 18 treesize of output 24 [2019-01-08 14:34:42,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,440 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 20 treesize of output 34 [2019-01-08 14:34:42,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:42,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,501 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-08 14:34:42,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,528 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-08 14:34:42,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,560 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-08 14:34:42,560 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,570 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,596 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:42,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,624 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-08 14:34:42,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,641 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-08 14:34:42,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:42,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,667 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:42,668 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-08 14:34:42,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,688 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-08 14:34:42,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-08 14:34:42,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,714 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-08 14:34:42,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,734 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-08 14:34:42,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-08 14:34:42,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:42,763 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:42,764 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-08 14:34:42,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:42,792 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-08 14:34:42,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-08 14:34:42,809 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-08 14:34:42,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:42,855 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-08 14:34:42,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:42,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:34:42,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:42,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:34:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:34:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:42,875 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-01-08 14:34:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:43,512 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-01-08 14:34:43,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:43,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:34:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:43,514 INFO L225 Difference]: With dead ends: 104 [2019-01-08 14:34:43,514 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:34:43,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:34:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:34:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-01-08 14:34:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:34:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-01-08 14:34:43,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-01-08 14:34:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:43,599 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-01-08 14:34:43,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:34:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-01-08 14:34:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:43,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:43,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:43,600 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:43,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-01-08 14:34:43,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:43,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:43,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:43,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:43,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:43,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-08 14:34:43,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:43,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:43,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:34:43,665 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-08 14:34:43,666 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:43,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:44,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:44,292 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:34:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:44,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:44,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:44,293 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-08 14:34:44,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:44,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:44,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:44,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 15 treesize of output 18 [2019-01-08 14:34:44,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 18 treesize of output 20 [2019-01-08 14:34:44,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,326 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 20 treesize of output 30 [2019-01-08 14:34:44,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,338 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-08 14:34:44,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,400 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-08 14:34:44,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,414 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-08 14:34:44,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,446 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-08 14:34:44,447 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,456 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,482 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-08 14:34:44,483 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:34:44,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,514 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-08 14:34:44,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,524 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-08 14:34:44,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:34:44,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,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, 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-08 14:34:44,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,560 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-08 14:34:44,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-08 14:34:44,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,580 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:44,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:44,581 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 55 [2019-01-08 14:34:44,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:44,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-08 14:34:44,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-01-08 14:34:44,616 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-08 14:34:44,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:44,654 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-08 14:34:44,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:44,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:34:44,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:44,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:34:44,676 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-01-08 14:34:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:45,137 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-01-08 14:34:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:34:45,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:34:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:45,139 INFO L225 Difference]: With dead ends: 68 [2019-01-08 14:34:45,139 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:34:45,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:34:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-08 14:34:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 14:34:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-01-08 14:34:45,277 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-01-08 14:34:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:45,277 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-01-08 14:34:45,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-01-08 14:34:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:45,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:45,278 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-08 14:34:45,278 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-01-08 14:34:45,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:45,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:45,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:45,329 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-08 14:34:45,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:34:45,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:34:45,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:34:45,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:34:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:34:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:34:45,330 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-01-08 14:34:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:45,499 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-01-08 14:34:45,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:34:45,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-08 14:34:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:45,500 INFO L225 Difference]: With dead ends: 54 [2019-01-08 14:34:45,500 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 14:34:45,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:34:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 14:34:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-08 14:34:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 14:34:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-01-08 14:34:45,736 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-01-08 14:34:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:45,737 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-01-08 14:34:45,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:34:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-01-08 14:34:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:45,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:45,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:45,738 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-08 14:34:45,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:45,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:45,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:45,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:45,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:45,916 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-08 14:34:45,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:45,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:45,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:34:45,917 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-08 14:34:45,918 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:45,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:46,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:46,541 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:34:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:46,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:46,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:46,542 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-08 14:34:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:46,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:46,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:46,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,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, 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-08 14:34:46,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,624 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-08 14:34:46,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,657 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-08 14:34:46,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:34:46,699 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 18 treesize of output 24 [2019-01-08 14:34:46,701 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 20 treesize of output 34 [2019-01-08 14:34:46,720 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 22 treesize of output 45 [2019-01-08 14:34:46,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,811 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,819 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,828 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,847 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-08 14:34:46,847 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:46,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,884 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-08 14:34:46,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,902 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-08 14:34:46,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:46,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:46,929 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-08 14:34:46,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,949 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-08 14:34:46,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-08 14:34:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:46,974 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-08 14:34:46,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:46,995 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-08 14:34:46,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-08 14:34:47,015 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-08 14:34:47,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:34:47,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:47,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:34:47,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:47,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:47,060 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-01-08 14:34:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:47,487 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-01-08 14:34:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:34:47,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:34:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:47,489 INFO L225 Difference]: With dead ends: 78 [2019-01-08 14:34:47,489 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 14:34:47,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:34:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 14:34:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-01-08 14:34:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:34:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-01-08 14:34:47,604 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-01-08 14:34:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:47,604 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-01-08 14:34:47,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-01-08 14:34:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:47,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:47,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:47,605 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:47,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-01-08 14:34:47,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:47,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:47,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:47,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:47,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:47,751 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2019-01-08 14:34:47,787 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-08 14:34:47,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:47,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:47,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:34:47,788 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-08 14:34:47,789 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:47,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:48,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:48,017 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-08 14:34:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:48,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:48,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:48,017 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-08 14:34:48,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:48,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:48,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:48,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,060 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-08 14:34:48,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,098 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-08 14:34:48,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,131 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-08 14:34:48,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,167 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 15 treesize of output 18 [2019-01-08 14:34:48,170 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 18 treesize of output 24 [2019-01-08 14:34:48,173 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 20 treesize of output 34 [2019-01-08 14:34:48,176 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 22 treesize of output 45 [2019-01-08 14:34:48,176 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,191 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,225 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-08 14:34:48,226 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:48,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,250 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-08 14:34:48,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,271 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-08 14:34:48,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:48,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:48,308 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-08 14:34:48,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:48,349 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-08 14:34:48,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:48,373 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-08 14:34:48,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:48,411 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-08 14:34:48,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:48,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:34:48,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:48,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:34:48,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:34:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:34:48,431 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-01-08 14:34:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:48,939 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-01-08 14:34:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:34:48,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:34:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:48,940 INFO L225 Difference]: With dead ends: 64 [2019-01-08 14:34:48,940 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 14:34:48,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:34:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 14:34:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-08 14:34:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 14:34:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-01-08 14:34:49,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-01-08 14:34:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:49,061 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-01-08 14:34:49,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:34:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-01-08 14:34:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:49,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:49,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:49,062 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-08 14:34:49,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:49,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:49,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:49,134 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-08 14:34:49,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:49,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:49,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:49,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:49,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:49,135 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-08 14:34:49,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:49,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:49,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:34:49,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:49,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:49,155 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-08 14:34:49,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,172 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-08 14:34:49,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,206 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-08 14:34:49,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,269 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 15 treesize of output 18 [2019-01-08 14:34:49,272 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 18 treesize of output 20 [2019-01-08 14:34:49,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-08 14:34:49,278 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-08 14:34:49,278 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,293 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,301 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,327 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-08 14:34:49,328 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-08 14:34:49,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:34:49,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,373 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-08 14:34:49,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:34:49,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,397 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-08 14:34:49,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,411 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-08 14:34:49,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-08 14:34:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:49,435 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:49,436 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 55 [2019-01-08 14:34:49,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:49,452 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-08 14:34:49,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-08 14:34:49,469 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-08 14:34:49,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:49,512 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-08 14:34:49,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:34:49,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:49,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:49,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:49,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:34:49,533 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-01-08 14:34:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:49,993 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-01-08 14:34:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:34:49,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:34:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:49,994 INFO L225 Difference]: With dead ends: 76 [2019-01-08 14:34:49,994 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:34:49,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:34:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:34:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-01-08 14:34:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:34:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-01-08 14:34:50,141 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-01-08 14:34:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:50,141 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-01-08 14:34:50,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-01-08 14:34:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:34:50,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:50,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:50,142 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-01-08 14:34:50,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:50,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:50,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:34:50,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:50,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:50,261 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-08 14:34:50,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:50,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:50,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:34:50,262 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-01-08 14:34:50,263 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:50,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:50,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:50,539 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-08 14:34:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:50,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:50,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:50,539 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-08 14:34:50,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:50,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:50,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:50,558 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 14 treesize of output 17 [2019-01-08 14:34:50,566 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 17 treesize of output 19 [2019-01-08 14:34:50,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-01-08 14:34:50,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,625 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 15 treesize of output 18 [2019-01-08 14:34:50,630 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 18 treesize of output 20 [2019-01-08 14:34:50,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-08 14:34:50,642 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:34:50,642 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,653 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,662 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,683 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-08 14:34:50,684 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-08 14:34:50,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,721 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 34 [2019-01-08 14:34:50,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:34:50,752 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 2 xjuncts. [2019-01-08 14:34:50,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-08 14:34:50,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,780 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:50,780 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 21 [2019-01-08 14:34:50,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:50,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-08 14:34:50,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:50,832 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-08 14:34:50,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-08 14:34:50,859 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-08 14:34:50,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:50,877 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-08 14:34:50,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:50,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-08 14:34:50,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:50,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:34:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:34:50,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:34:50,898 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-01-08 14:34:51,338 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-01-08 14:34:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:51,935 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-01-08 14:34:51,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:34:51,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:34:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:51,936 INFO L225 Difference]: With dead ends: 90 [2019-01-08 14:34:51,937 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 14:34:51,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:34:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 14:34:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-01-08 14:34:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 14:34:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-01-08 14:34:52,151 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-01-08 14:34:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:52,152 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-01-08 14:34:52,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:34:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-01-08 14:34:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:34:52,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:52,152 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:52,152 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-01-08 14:34:52,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:52,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:52,345 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-08 14:34:52,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:52,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:52,346 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:34:52,346 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-08 14:34:52,347 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:52,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:52,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:52,857 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-08 14:34:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:52,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:52,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:52,858 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-08 14:34:52,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:52,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:52,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:52,897 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 15 treesize of output 18 [2019-01-08 14:34:52,902 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 18 treesize of output 24 [2019-01-08 14:34:52,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:52,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:52,911 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 20 treesize of output 34 [2019-01-08 14:34:52,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:52,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:52,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:52,922 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 22 treesize of output 45 [2019-01-08 14:34:52,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:52,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:52,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:52,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:52,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:52,987 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-08 14:34:53,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,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, 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-08 14:34:53,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,049 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-08 14:34:53,049 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:53,059 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:53,069 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:53,088 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-08 14:34:53,088 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:53,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,110 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-08 14:34:53,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:53,129 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-08 14:34:53,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,155 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-08 14:34:53,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:53,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-08 14:34:53,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:53,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:53,205 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-08 14:34:53,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:53,233 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-08 14:34:53,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:53,252 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-08 14:34:53,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:53,283 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-08 14:34:53,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:53,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-08 14:34:53,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:53,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:34:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:34:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:34:53,304 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-01-08 14:34:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:54,027 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-01-08 14:34:54,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:34:54,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:34:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:54,029 INFO L225 Difference]: With dead ends: 118 [2019-01-08 14:34:54,029 INFO L226 Difference]: Without dead ends: 106 [2019-01-08 14:34:54,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:34:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-08 14:34:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-01-08 14:34:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-08 14:34:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-01-08 14:34:54,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-01-08 14:34:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:54,294 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-01-08 14:34:54,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:34:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-01-08 14:34:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:34:54,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:54,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:54,295 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-01-08 14:34:54,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:54,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:54,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:54,428 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-08 14:34:54,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:54,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:54,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:34:54,429 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-01-08 14:34:54,430 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:54,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:55,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:55,244 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-08 14:34:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:55,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:55,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:55,245 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-08 14:34:55,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:55,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:55,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:55,285 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 15 treesize of output 18 [2019-01-08 14:34:55,287 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 18 treesize of output 24 [2019-01-08 14:34:55,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,293 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 20 treesize of output 34 [2019-01-08 14:34:55,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:34:55,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,379 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-08 14:34:55,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,406 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-08 14:34:55,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,440 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-08 14:34:55,440 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,449 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,458 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,478 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:34:55,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,506 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-08 14:34:55,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,529 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-08 14:34:55,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:34:55,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,558 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-08 14:34:55,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,580 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-08 14:34:55,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:34:55,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,676 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:55,677 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-08 14:34:55,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,702 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-08 14:34:55,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-08 14:34:55,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,728 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:55,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:55,730 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-08 14:34:55,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:55,755 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-08 14:34:55,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-08 14:34:55,776 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-08 14:34:55,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:55,823 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-08 14:34:55,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:55,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-08 14:34:55,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:55,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:34:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:34:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:34:55,844 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-01-08 14:34:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:56,805 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-01-08 14:34:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:34:56,806 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-08 14:34:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:56,808 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:34:56,808 INFO L226 Difference]: Without dead ends: 119 [2019-01-08 14:34:56,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:34:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-08 14:34:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-01-08 14:34:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 14:34:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-01-08 14:34:57,184 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-01-08 14:34:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:57,184 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-01-08 14:34:57,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:34:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-01-08 14:34:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:34:57,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:57,185 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:57,185 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:57,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:57,185 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-01-08 14:34:57,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:57,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:57,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:57,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:57,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:57,283 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-08 14:34:57,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:57,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:57,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:34:57,284 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-01-08 14:34:57,285 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:34:57,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:34:57,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:34:57,500 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-08 14:34:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:57,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:34:57,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:57,501 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-08 14:34:57,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:57,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:34:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:57,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:57,520 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 15 treesize of output 18 [2019-01-08 14:34:57,525 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 18 treesize of output 20 [2019-01-08 14:34:57,537 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 20 treesize of output 22 [2019-01-08 14:34:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,553 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-08 14:34:57,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-08 14:34:57,610 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 17 treesize of output 19 [2019-01-08 14:34:57,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-01-08 14:34:57,628 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,633 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,653 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-08 14:34:57,653 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-08 14:34:57,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,691 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 34 [2019-01-08 14:34:57,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:34:57,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-08 14:34:57,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-08 14:34:57,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,753 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 21 treesize of output 27 [2019-01-08 14:34:57,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,784 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 40 [2019-01-08 14:34:57,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,805 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-08 14:34:57,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-01-08 14:34:57,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,834 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 21 treesize of output 27 [2019-01-08 14:34:57,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:57,861 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 48 [2019-01-08 14:34:57,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:57,885 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-08 14:34:57,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-01-08 14:34:57,913 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-08 14:34:57,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:34:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:34:57,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:34:57,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:34:57,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:34:57,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:34:57,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:34:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:34:57,976 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-01-08 14:34:58,287 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-01-08 14:34:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:34:58,801 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-01-08 14:34:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:34:58,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:34:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:34:58,803 INFO L225 Difference]: With dead ends: 87 [2019-01-08 14:34:58,803 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:34:58,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:34:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:34:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-08 14:34:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 14:34:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-01-08 14:34:59,151 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-01-08 14:34:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:34:59,151 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-01-08 14:34:59,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:34:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-01-08 14:34:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:34:59,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:34:59,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:34:59,153 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:34:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:34:59,153 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-01-08 14:34:59,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:34:59,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:59,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:34:59,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:34:59,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:34:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:34:59,291 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-08 14:34:59,372 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-08 14:34:59,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:59,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:34:59,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:34:59,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:34:59,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:34:59,373 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-08 14:34:59,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:34:59,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:34:59,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:34:59,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:34:59,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:34:59,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 15 treesize of output 18 [2019-01-08 14:34:59,397 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 18 treesize of output 20 [2019-01-08 14:34:59,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,404 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 20 treesize of output 30 [2019-01-08 14:34:59,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,418 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-08 14:34:59,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,467 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-08 14:34:59,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,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-08 14:34:59,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,509 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-08 14:34:59,510 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,518 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,526 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,544 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-01-08 14:34:59,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,579 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-08 14:34:59,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:34:59,638 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 2 xjuncts. [2019-01-08 14:34:59,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-01-08 14:34:59,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,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 43 treesize of output 65 [2019-01-08 14:34:59,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:59,759 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 30 treesize of output 34 [2019-01-08 14:34:59,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,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 2 xjuncts. [2019-01-08 14:34:59,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-01-08 14:34:59,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,843 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:34:59,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 37 treesize of output 77 [2019-01-08 14:34:59,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,889 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 38 treesize of output 34 [2019-01-08 14:34:59,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,915 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-08 14:34:59,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-01-08 14:34:59,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,955 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 40 [2019-01-08 14:34:59,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:34:59,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:34:59,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:00,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:00,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:00,004 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:35:00,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, 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-08 14:35:00,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:00,041 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-08 14:35:00,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-01-08 14:35:00,078 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-08 14:35:00,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:35:00,133 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-08 14:35:00,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:35:00,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-08 14:35:00,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:35:00,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:35:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:35:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:35:00,154 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-01-08 14:35:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:35:01,584 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-01-08 14:35:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:35:01,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-08 14:35:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:35:01,587 INFO L225 Difference]: With dead ends: 186 [2019-01-08 14:35:01,587 INFO L226 Difference]: Without dead ends: 177 [2019-01-08 14:35:01,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:35:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-08 14:35:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-01-08 14:35:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 14:35:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-01-08 14:35:02,071 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-01-08 14:35:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:35:02,072 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-01-08 14:35:02,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:35:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-01-08 14:35:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:35:02,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:35:02,072 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:35:02,073 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:35:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:35:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-01-08 14:35:02,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:35:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:35:02,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:35:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:35:02,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:35:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:35:02,258 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-08 14:35:02,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:35:02,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:35:02,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:35:02,260 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-08 14:35:02,261 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:35:02,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:35:02,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:35:02,948 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-08 14:35:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:35:02,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:35:02,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:35:02,949 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-08 14:35:02,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:35:02,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:35:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:35:02,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:35:02,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:02,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, 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-08 14:35:03,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,035 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-08 14:35:03,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,082 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-08 14:35:03,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:35:03,122 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 18 treesize of output 24 [2019-01-08 14:35:03,126 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 20 treesize of output 34 [2019-01-08 14:35:03,128 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 22 treesize of output 45 [2019-01-08 14:35:03,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,142 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,151 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,160 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,211 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-08 14:35:03,211 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-08 14:35:03,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,239 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-08 14:35:03,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,257 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-08 14:35:03,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:35:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,286 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-08 14:35:03,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,307 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-08 14:35:03,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-08 14:35:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,340 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:35:03,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 33 treesize of output 77 [2019-01-08 14:35:03,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,363 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-08 14:35:03,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-08 14:35:03,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:03,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, 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 89 [2019-01-08 14:35:03,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:03,424 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-08 14:35:03,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-08 14:35:03,445 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-08 14:35:03,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:35:03,517 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-08 14:35:03,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:35:03,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:35:03,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:35:03,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:35:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:35:03,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:35:03,539 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-01-08 14:35:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:35:04,389 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-01-08 14:35:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:35:04,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:35:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:35:04,395 INFO L225 Difference]: With dead ends: 110 [2019-01-08 14:35:04,395 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:35:04,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:35:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:35:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-01-08 14:35:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:35:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-08 14:35:04,514 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-01-08 14:35:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:35:04,514 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-08 14:35:04,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:35:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-08 14:35:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:35:04,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:35:04,515 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:35:04,515 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:35:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:35:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-01-08 14:35:04,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:35:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:35:04,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:35:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:35:04,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:35:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:35:04,713 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-08 14:35:04,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:35:04,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:35:04,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:35:04,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:35:04,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:35:04,714 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-08 14:35:04,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:35:04,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:35:04,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:35:04,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:35:04,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:35:04,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,742 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-08 14:35:04,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,769 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-08 14:35:04,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,804 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-08 14:35:04,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,840 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 15 treesize of output 18 [2019-01-08 14:35:04,843 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 18 treesize of output 24 [2019-01-08 14:35:04,846 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 20 treesize of output 34 [2019-01-08 14:35:04,849 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 22 treesize of output 45 [2019-01-08 14:35:04,849 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,865 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,899 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-08 14:35:04,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,928 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-08 14:35:04,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:04,949 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-08 14:35:04,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-08 14:35:04,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:04,979 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-08 14:35:04,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:05,002 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-08 14:35:05,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-01-08 14:35:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:35:05,036 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-08 14:35:05,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:05,060 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-08 14:35:05,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-01-08 14:35:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,089 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:35:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,091 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-08 14:35:05,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:05,115 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-08 14:35:05,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-01-08 14:35:05,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:35:05,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, 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 59 [2019-01-08 14:35:05,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:35:05,171 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-08 14:35:05,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-01-08 14:35:05,195 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-08 14:35:05,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:35:05,269 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-08 14:35:05,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:35:05,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-08 14:35:05,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:35:05,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:35:05,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:35:05,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:35:05,290 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-01-08 14:35:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:35:05,807 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-01-08 14:35:05,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:35:05,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-08 14:35:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:35:05,808 INFO L225 Difference]: With dead ends: 32 [2019-01-08 14:35:05,808 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:35:05,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:35:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:35:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:35:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:35:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:35:05,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-08 14:35:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:35:05,810 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:35:05,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:35:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:35:05,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:35:05,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:35:05,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:05,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:06,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:07,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:07,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:07,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:07,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:13,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:13,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:18,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:35:20,156 WARN L181 SmtUtils]: Spent 14.33 s on a formula simplification. DAG size of input: 1516 DAG size of output: 1068 [2019-01-08 14:35:34,668 WARN L181 SmtUtils]: Spent 14.50 s on a formula simplification. DAG size of input: 1007 DAG size of output: 76 [2019-01-08 14:35:34,671 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:35:34,671 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-08 14:35:34,671 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-08 14:35:34,671 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-01-08 14:35:34,671 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-08 14:35:34,672 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse3 1)))) (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse9 (= 0 (select .cse17 ULTIMATE.start_main_p1))) (.cse6 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse10 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse5 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse4 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse7 1))) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p4))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse1 0) (<= .cse2 0) (= .cse3 0) .cse4 .cse5 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse6 (<= 0 .cse7)) (and (and .cse8 .cse9 (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1))) ULTIMATE.start_main_p3)) .cse10) (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0)) (and (<= .cse1 0) (let ((.cse12 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse1 (- 1))))) (or (and .cse0 .cse8 .cse9 .cse6 .cse10 (<= 1 (select .cse12 ULTIMATE.start_main_p3))) (and .cse5 (let ((.cse16 (select .cse12 ULTIMATE.start_main_p1))) (let ((.cse14 (and .cse8 (<= 1 .cse16) .cse0)) (.cse13 (<= 0 .cse3))) (or (and .cse13 (= 0 (select .cse12 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse14) (let ((.cse15 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (and .cse13 .cse14) .cse15) (and .cse13 .cse15 (= 0 .cse16) .cse4)))))))))))))) [2019-01-08 14:35:34,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:35:34,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-01-08 14:35:34,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-08 14:35:34,672 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-01-08 14:35:34,672 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-08 14:35:34,686 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:35:34 BoogieIcfgContainer [2019-01-08 14:35:34,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:35:34,687 INFO L168 Benchmark]: Toolchain (without parser) took 123141.59 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-01-08 14:35:34,688 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:35:34,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:35:34,688 INFO L168 Benchmark]: Boogie Preprocessor took 37.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:35:34,688 INFO L168 Benchmark]: RCFGBuilder took 424.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:35:34,689 INFO L168 Benchmark]: TraceAbstraction took 122602.38 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-01-08 14:35:34,690 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 424.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 122602.38 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (#memory_int[p4] <= 0 && ((((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) || (!(p3 == p4) && ((((0 <= #memory_int[p3] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || ((0 <= #memory_int[p3] && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) || (((0 <= #memory_int[p3] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)))))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 122.5s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 24.9s AutomataDifference, 0.0s DeadEndRemovalTime, 28.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 25.3s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 286 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4050516002 FormulaSimplificationTreeSizeReduction, 14.3s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39887995 FormulaSimplificationTreeSizeReductionInter, 14.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91527 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...