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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:02:01,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:02:01,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:02:01,402 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:02:01,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:02:01,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:02:01,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:02:01,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:02:01,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:02:01,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:02:01,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:02:01,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:02:01,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:02:01,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:02:01,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:02:01,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:02:01,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:02:01,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:02:01,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:02:01,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:02:01,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:02:01,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:02:01,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:02:01,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:02:01,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:02:01,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:02:01,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:02:01,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:02:01,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:02:01,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:02:01,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:02:01,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:02:01,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:02:01,431 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:02:01,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:02:01,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:02:01,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 10:02:01,454 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:02:01,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:02:01,457 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:02:01,457 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:02:01,457 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:02:01,457 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:02:01,458 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:02:01,460 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:02:01,460 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:02:01,460 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:02:01,461 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:02:01,461 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:02:01,461 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:02:01,461 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:02:01,462 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:02:01,462 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:02:01,462 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:02:01,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:02:01,463 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:02:01,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:02:01,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:02:01,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:02:01,463 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:02:01,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:02:01,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:02:01,465 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:02:01,466 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:02:01,466 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:02:01,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:02:01,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:02:01,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:02:01,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:02:01,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:02:01,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:02:01,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:02:01,468 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:02:01,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:02:01,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:02:01,468 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:02:01,468 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:02:01,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:02:01,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:02:01,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:02:01,536 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:02:01,536 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:02:01,537 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-01-20 10:02:01,537 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-20 10:02:01,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:02:01,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:02:01,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:02:01,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:02:01,579 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:02:01,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:02:01,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:02:01,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:02:01,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:02:01,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... [2019-01-20 10:02:01,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:02:01,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:02:01,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:02:01,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:02:01,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:02:01,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:02:01,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:02:02,093 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:02:02,094 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-20 10:02:02,096 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:02:02 BoogieIcfgContainer [2019-01-20 10:02:02,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:02:02,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:02:02,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:02:02,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:02:02,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:02:01" (1/2) ... [2019-01-20 10:02:02,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7b8bd6 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:02:02, skipping insertion in model container [2019-01-20 10:02:02,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:02:02" (2/2) ... [2019-01-20 10:02:02,106 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-20 10:02:02,117 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:02:02,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-20 10:02:02,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-20 10:02:02,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:02:02,180 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:02:02,180 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:02:02,180 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:02:02,180 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:02:02,180 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:02:02,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:02:02,181 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:02:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-20 10:02:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:02:02,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:02,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:02:02,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-20 10:02:02,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:02,435 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-20 10:02:02,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:02:02,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:02:02,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:02:02,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:02:02,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:02:02,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:02:02,469 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-20 10:02:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:02,673 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-20 10:02:02,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:02:02,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:02:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:02,689 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:02:02,690 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 10:02:02,693 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-20 10:02:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 10:02:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-20 10:02:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 10:02:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-20 10:02:02,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-20 10:02:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:02,731 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-20 10:02:02,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:02:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-20 10:02:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:02:02,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:02,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:02:02,733 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:02,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-20 10:02:02,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:02,856 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-20 10:02:02,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:02,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:02,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:02:02,860 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-20 10:02:02,898 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:02,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:03,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:03,008 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:03,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:03,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:03,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 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-20 10:02:03,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:03,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:03,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:03,121 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-20 10:02:03,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,175 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-20 10:02:03,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,241 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-20 10:02:03,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,280 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-20 10:02:03,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:03,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:03,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:03,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:03,642 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-20 10:02:03,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:03,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:03,759 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-20 10:02:03,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:03,815 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-20 10:02:03,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:03,897 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-20 10:02:03,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:03,980 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-20 10:02:04,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:04,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:02:04,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:04,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:02:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:02:04,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:04,004 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-20 10:02:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:04,368 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-20 10:02:04,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:02:04,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:02:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:04,370 INFO L225 Difference]: With dead ends: 31 [2019-01-20 10:02:04,371 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:02:04,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:02:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:02:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-20 10:02:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:02:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-20 10:02:04,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-20 10:02:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:04,378 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-20 10:02:04,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:02:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-20 10:02:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:02:04,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:04,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:02:04,381 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-20 10:02:04,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:04,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:04,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:04,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:04,424 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-20 10:02:04,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:02:04,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:02:04,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:02:04,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:02:04,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:02:04,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:02:04,426 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-20 10:02:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:04,485 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-20 10:02:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:02:04,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:02:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:04,487 INFO L225 Difference]: With dead ends: 15 [2019-01-20 10:02:04,487 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 10:02:04,488 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-20 10:02:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 10:02:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-20 10:02:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:02:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-20 10:02:04,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-20 10:02:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:04,492 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-20 10:02:04,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:02:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-20 10:02:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:02:04,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:04,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:02:04,493 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:04,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:04,493 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-20 10:02:04,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:04,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:04,570 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-20 10:02:04,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:04,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:04,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:02:04,571 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-20 10:02:04,577 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:04,577 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:04,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:04,588 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:04,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:04,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:04,589 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-20 10:02:04,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:04,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:04,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:04,639 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-20 10:02:04,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:04,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 10:02:04,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:04,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:04,712 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-20 10:02:04,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:04,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:04,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:04,803 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-20 10:02:04,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:04,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:04,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:04,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,002 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-20 10:02:05,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:05,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,075 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-20 10:02:05,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,136 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-20 10:02:05,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:05,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:05,205 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-20 10:02:05,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:02:05,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:02:05,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:02:05,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:02:05,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:02:05,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:05,226 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-20 10:02:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:05,308 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-20 10:02:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:02:05,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:02:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:05,310 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:02:05,310 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:02:05,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:02:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-20 10:02:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:02:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-20 10:02:05,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-20 10:02:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:05,317 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-20 10:02:05,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:02:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-20 10:02:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:02:05,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:05,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:02:05,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:05,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-20 10:02:05,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:05,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:05,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:05,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:05,486 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-20 10:02:05,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:05,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:05,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:02:05,487 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-20 10:02:05,489 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:05,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:05,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:05,496 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:05,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:05,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:05,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:02:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:05,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:05,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:05,522 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-20 10:02:05,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,528 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-20 10:02:05,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,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, 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-20 10:02:05,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,571 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-20 10:02:05,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,634 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-20 10:02:05,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:05,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:05,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 31 treesize of output 51 [2019-01-20 10:02:05,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:05,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:05,775 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-20 10:02:05,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:05,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-20 10:02:05,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:05,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:02:05,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:05,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:02:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:02:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:05,828 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-20 10:02:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:05,994 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-20 10:02:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:02:05,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:02:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:05,996 INFO L225 Difference]: With dead ends: 32 [2019-01-20 10:02:05,996 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 10:02:05,996 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-20 10:02:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 10:02:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-20 10:02:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:02:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-20 10:02:06,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-20 10:02:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:06,003 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-20 10:02:06,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:02:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-20 10:02:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:06,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:06,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:06,004 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:06,004 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-20 10:02:06,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:06,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:06,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:06,071 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-20 10:02:06,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:06,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:06,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:06,072 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-20 10:02:06,074 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:06,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:06,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:06,084 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:06,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:06,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:06,085 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-20 10:02:06,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:06,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:06,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:06,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:02:06,113 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-20 10:02:06,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:06,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,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, 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-20 10:02:06,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,220 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-20 10:02:06,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:06,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,316 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-20 10:02:06,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,337 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-20 10:02:06,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:06,360 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-20 10:02:06,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:06,377 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-20 10:02:06,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:02:06,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:02:06,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:02:06,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:02:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:02:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:06,397 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-20 10:02:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:06,446 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-20 10:02:06,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:02:06,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:02:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:06,448 INFO L225 Difference]: With dead ends: 22 [2019-01-20 10:02:06,448 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:02:06,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:02:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-20 10:02:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:02:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-20 10:02:06,455 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-20 10:02:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:06,455 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-20 10:02:06,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:02:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-20 10:02:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:06,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:06,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:06,456 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-20 10:02:06,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:06,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:06,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:06,565 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-20 10:02:06,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:06,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:06,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:06,566 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-20 10:02:06,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:06,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:06,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:06,574 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:06,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:06,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:06,575 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-20 10:02:06,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:06,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:06,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:06,602 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-20 10:02:06,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 10:02:06,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,616 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-20 10:02:06,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,631 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-20 10:02:06,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,695 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-20 10:02:06,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:06,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,732 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-20 10:02:06,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,787 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-20 10:02:06,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:06,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:06,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:06,826 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-20 10:02:06,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:06,978 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-20 10:02:06,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:07,001 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-20 10:02:07,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:07,029 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-20 10:02:07,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:07,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:07,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:07,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:07,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:07,049 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-20 10:02:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:07,411 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-20 10:02:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:07,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:02:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:07,413 INFO L225 Difference]: With dead ends: 37 [2019-01-20 10:02:07,413 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:02:07,414 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-20 10:02:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:02:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-20 10:02:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:02:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-20 10:02:07,421 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-20 10:02:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-20 10:02:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-20 10:02:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:07,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:07,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:07,422 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-20 10:02:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:07,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:07,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:07,547 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-20 10:02:07,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:07,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:07,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:07,548 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-20 10:02:07,550 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:07,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:07,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:07,556 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:07,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:07,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:07,557 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-20 10:02:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:07,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:07,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:07,584 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-20 10:02:07,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,590 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-20 10:02:07,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,600 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-20 10:02:07,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,614 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-20 10:02:07,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:07,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:07,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:07,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:07,669 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-20 10:02:07,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:07,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:07,873 INFO L303 Elim1Store]: Index analysis took 182 ms [2019-01-20 10:02:07,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:07,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:07,997 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-20 10:02:07,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,028 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-20 10:02:08,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:08,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:08,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:08,106 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-20 10:02:08,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:08,142 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-20 10:02:08,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:08,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:08,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:08,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:08,162 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-20 10:02:08,401 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-20 10:02:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:08,560 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-01-20 10:02:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:08,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:02:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:08,562 INFO L225 Difference]: With dead ends: 42 [2019-01-20 10:02:08,562 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:02:08,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:02:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-01-20 10:02:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-20 10:02:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-01-20 10:02:08,571 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-01-20 10:02:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:08,571 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-01-20 10:02:08,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-01-20 10:02:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:08,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:08,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:08,573 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:08,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:08,573 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-20 10:02:08,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:08,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:08,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:08,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:08,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:08,715 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-20 10:02:08,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:08,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:08,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:08,716 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-20 10:02:08,717 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:08,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:08,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:08,723 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:08,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:08,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:08,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:08,724 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-20 10:02:08,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:08,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:08,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:08,749 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-20 10:02:08,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,754 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-20 10:02:08,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,766 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-20 10:02:08,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,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, 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-20 10:02:08,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:08,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:08,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:08,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:08,846 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-20 10:02:08,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:08,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,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-20 10:02:08,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:08,969 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-20 10:02:08,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:08,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:08,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,003 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-20 10:02:09,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:09,088 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-20 10:02:09,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:09,106 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-20 10:02:09,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:09,143 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-20 10:02:09,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:09,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:09,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:09,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:09,163 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-01-20 10:02:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:09,537 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-01-20 10:02:09,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:09,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:02:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:09,539 INFO L225 Difference]: With dead ends: 51 [2019-01-20 10:02:09,539 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:02:09,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:02:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-01-20 10:02:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 10:02:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-20 10:02:09,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-20 10:02:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:09,550 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-20 10:02:09,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-20 10:02:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:09,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:09,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:09,551 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-20 10:02:09,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:09,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:09,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:09,627 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-20 10:02:09,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:09,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:09,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:09,628 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-20 10:02:09,629 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:09,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:09,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:09,634 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:09,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:09,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:09,635 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-20 10:02:09,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:09,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:09,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:09,677 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-20 10:02:09,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,683 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-20 10:02:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-20 10:02:09,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:02:09,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:09,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:09,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:09,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:09,765 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-20 10:02:09,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:09,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:09,805 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-20 10:02:09,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:09,849 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-20 10:02:09,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:09,865 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-20 10:02:09,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:09,876 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-20 10:02:09,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:09,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:02:09,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:09,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:02:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:02:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:09,896 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-01-20 10:02:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:10,092 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-01-20 10:02:10,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:02:10,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:02:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:10,094 INFO L225 Difference]: With dead ends: 36 [2019-01-20 10:02:10,094 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:02:10,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-20 10:02:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:02:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-20 10:02:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:02:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-01-20 10:02:10,102 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-01-20 10:02:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:10,102 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-01-20 10:02:10,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:02:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-01-20 10:02:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:10,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:10,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:10,104 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-20 10:02:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:10,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:10,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:10,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:10,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:10,179 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:10,179 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-20 10:02:10,181 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:10,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:10,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:10,187 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:10,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:10,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:10,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:02:10,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:10,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:10,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:10,210 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-20 10:02:10,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,215 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-20 10:02:10,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,255 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-20 10:02:10,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,277 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-20 10:02:10,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:10,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:10,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:10,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:10,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-20 10:02:10,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:10,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,392 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-20 10:02:10,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:10,429 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-20 10:02:10,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:10,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:10,481 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-20 10:02:10,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:10,519 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-20 10:02:10,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:10,533 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-20 10:02:10,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:10,556 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-20 10:02:10,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:10,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:10,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:10,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:10,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:10,576 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-01-20 10:02:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:10,970 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-01-20 10:02:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:10,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:02:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:10,972 INFO L225 Difference]: With dead ends: 55 [2019-01-20 10:02:10,972 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 10:02:10,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-20 10:02:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 10:02:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-01-20 10:02:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 10:02:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-01-20 10:02:10,987 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-01-20 10:02:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:10,987 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-01-20 10:02:10,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-01-20 10:02:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:10,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:10,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:10,988 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-20 10:02:10,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:10,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:10,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:11,082 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-20 10:02:11,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:11,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:11,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:11,083 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-20 10:02:11,084 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:11,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:11,089 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:11,089 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:11,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:11,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:11,090 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-20 10:02:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:11,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:11,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:11,110 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-20 10:02:11,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,117 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-20 10:02:11,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,124 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-20 10:02:11,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,136 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-20 10:02:11,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,198 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-20 10:02:11,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:11,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,226 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-20 10:02:11,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:11,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:11,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:11,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,338 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-20 10:02:11,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:11,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:11,380 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-20 10:02:11,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:11,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:11,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:11,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:11,401 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-01-20 10:02:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:11,725 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-01-20 10:02:11,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:11,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:02:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:11,726 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:02:11,727 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 10:02:11,727 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-20 10:02:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 10:02:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-01-20 10:02:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:02:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-20 10:02:11,737 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-20 10:02:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:11,737 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-20 10:02:11,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-20 10:02:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:02:11,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:11,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:02:11,739 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-20 10:02:11,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:11,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:11,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:11,783 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-20 10:02:11,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:11,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:11,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:02:11,784 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-20 10:02:11,785 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:11,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:11,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:11,790 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:11,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:11,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:11,790 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-20 10:02:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:11,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:11,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:11,808 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-20 10:02:11,815 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-20 10:02:11,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:11,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,839 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-20 10:02:11,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:11,901 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-20 10:02:11,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:11,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:11,985 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-20 10:02:11,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:12,033 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-20 10:02:12,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:12,047 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-20 10:02:12,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:12,062 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-20 10:02:12,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:12,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:02:12,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:12,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:02:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:02:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:02:12,082 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-01-20 10:02:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:12,224 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-01-20 10:02:12,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:02:12,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:02:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:12,225 INFO L225 Difference]: With dead ends: 48 [2019-01-20 10:02:12,225 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:02:12,226 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-20 10:02:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:02:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-20 10:02:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:02:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-20 10:02:12,237 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-20 10:02:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:12,237 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-20 10:02:12,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:02:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-20 10:02:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:12,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:12,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:12,238 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-20 10:02:12,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:12,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:12,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:12,360 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-20 10:02:12,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:12,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:12,361 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:12,361 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-20 10:02:12,365 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:12,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:12,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:12,370 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:12,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:12,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:12,371 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-20 10:02:12,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:12,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:12,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:12,396 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-20 10:02:12,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,401 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-20 10:02:12,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,420 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-20 10:02:12,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,432 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-20 10:02:12,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:12,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:12,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:12,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:12,498 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-20 10:02:12,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:12,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,526 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-20 10:02:12,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:12,554 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-20 10:02:12,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:12,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:12,592 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-20 10:02:12,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:12,622 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-20 10:02:12,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:12,640 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-20 10:02:12,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:12,768 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-20 10:02:12,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:12,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:12,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:12,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:12,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:12,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:12,788 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-01-20 10:02:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:13,072 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-01-20 10:02:13,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:13,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:02:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:13,074 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:02:13,074 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:02:13,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:02:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-20 10:02:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:02:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-20 10:02:13,082 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-20 10:02:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:13,082 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-20 10:02:13,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-20 10:02:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:13,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:13,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:13,084 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-20 10:02:13,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:13,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:13,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:13,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:13,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:13,257 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-20 10:02:13,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:13,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:13,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:13,258 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-20 10:02:13,259 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:13,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:13,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:13,263 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:13,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:13,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:13,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 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-20 10:02:13,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:13,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:13,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:13,291 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-20 10:02:13,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,298 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-20 10:02:13,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-20 10:02:13,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,319 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-20 10:02:13,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:13,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:13,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:13,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:13,379 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-20 10:02:13,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:13,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,419 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-20 10:02:13,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:13,445 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-20 10:02:13,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:13,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,475 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-20 10:02:13,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:13,504 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-20 10:02:13,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:13,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,531 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:13,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:13,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:13,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:13,571 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-20 10:02:13,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:13,588 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-20 10:02:13,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:13,623 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-20 10:02:13,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:13,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:13,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:13,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:13,642 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-01-20 10:02:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:14,177 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-01-20 10:02:14,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:02:14,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:02:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:14,179 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:02:14,179 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:02:14,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:02:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-01-20 10:02:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:02:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-20 10:02:14,191 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-20 10:02:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:14,192 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-20 10:02:14,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-20 10:02:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:14,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:14,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:14,193 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:14,193 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-20 10:02:14,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:14,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:14,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:14,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:14,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:14,377 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-20 10:02:14,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:14,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:14,378 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-20 10:02:14,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:14,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:14,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:14,384 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:14,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:14,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,385 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-20 10:02:14,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:14,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:14,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:14,404 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-20 10:02:14,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,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, 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-20 10:02:14,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,415 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-20 10:02:14,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,428 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-20 10:02:14,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:14,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:14,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,604 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-20 10:02:14,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:14,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,641 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:14,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:14,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,672 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-20 10:02:14,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:14,899 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-20 10:02:14,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:14,977 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-20 10:02:14,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:15,018 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-20 10:02:15,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:02:15,038 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-20 10:02:15,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:15,078 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-20 10:02:15,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:15,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:15,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:15,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:15,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:15,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:15,097 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-20 10:02:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:15,627 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-01-20 10:02:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:15,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:02:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:15,628 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:02:15,629 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:02:15,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:02:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:02:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-01-20 10:02:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:02:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-20 10:02:15,640 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-20 10:02:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:15,640 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-20 10:02:15,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-20 10:02:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:15,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:15,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:15,642 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-20 10:02:15,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:15,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:15,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:15,752 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-20 10:02:15,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:15,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:15,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:15,753 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-20 10:02:15,754 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:15,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:15,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:15,758 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:15,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:15,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:15,759 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-20 10:02:15,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:15,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:15,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:15,801 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-20 10:02:15,828 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-20 10:02:15,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,845 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:15,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,853 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-20 10:02:15,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:15,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:15,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:15,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:15,891 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-20 10:02:15,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:15,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,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, 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-20 10:02:15,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:15,938 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-20 10:02:15,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:15,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:15,962 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-20 10:02:15,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:15,982 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-20 10:02:15,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:02:15,998 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-20 10:02:15,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:16,019 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-20 10:02:16,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:16,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:16,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:16,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:16,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:16,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:16,038 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-01-20 10:02:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:16,250 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-01-20 10:02:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:16,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:02:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:16,252 INFO L225 Difference]: With dead ends: 58 [2019-01-20 10:02:16,252 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:02:16,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-20 10:02:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:02:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-20 10:02:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:02:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-20 10:02:16,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-20 10:02:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:16,264 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-20 10:02:16,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-20 10:02:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:16,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:16,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:16,266 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:16,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:16,266 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-01-20 10:02:16,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:16,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:16,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:16,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:16,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:16,401 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-20 10:02:16,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:16,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:16,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:16,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:16,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:16,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 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-20 10:02:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:16,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:16,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:02:16,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:16,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:16,428 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-20 10:02:16,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,435 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-20 10:02:16,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,441 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-20 10:02:16,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,455 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-20 10:02:16,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:16,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:16,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:16,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:16,511 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-20 10:02:16,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:16,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:16,608 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-20 10:02:16,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:16,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,663 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-20 10:02:16,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:16,695 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-20 10:02:16,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:16,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:16,728 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-20 10:02:16,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:16,779 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-20 10:02:16,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:16,797 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-20 10:02:16,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:16,830 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-20 10:02:16,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:16,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:16,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:16,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:16,850 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-20 10:02:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:17,222 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-01-20 10:02:17,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:02:17,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:02:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:17,224 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:02:17,224 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:02:17,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:02:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-01-20 10:02:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:02:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-20 10:02:17,234 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-01-20 10:02:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:17,234 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-20 10:02:17,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-20 10:02:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:17,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:17,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:17,236 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-20 10:02:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:17,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:17,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:17,290 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-20 10:02:17,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:02:17,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:02:17,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:02:17,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:02:17,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:02:17,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:02:17,292 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-01-20 10:02:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:17,579 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-01-20 10:02:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:02:17,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:02:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:17,581 INFO L225 Difference]: With dead ends: 36 [2019-01-20 10:02:17,581 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 10:02:17,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:02:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 10:02:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-20 10:02:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:02:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-01-20 10:02:17,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-01-20 10:02:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:17,597 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-01-20 10:02:17,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:02:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-01-20 10:02:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:17,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:17,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:17,598 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-20 10:02:17,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:17,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:17,886 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-20 10:02:18,001 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-20 10:02:18,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:18,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:18,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:18,002 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-20 10:02:18,003 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:18,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:18,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:18,007 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:18,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:18,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:18,008 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-20 10:02:18,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:18,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:18,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:18,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:02:18,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,030 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-20 10:02:18,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,038 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-20 10:02:18,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,080 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-20 10:02:18,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:18,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:18,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:18,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:18,137 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-20 10:02:18,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:18,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,161 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-20 10:02:18,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:18,510 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-20 10:02:18,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:18,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:18,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:18,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:18,634 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-20 10:02:18,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:18,671 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-20 10:02:18,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:18,683 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-20 10:02:18,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:18,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:02:18,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:18,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:18,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:02:18,703 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-01-20 10:02:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:18,888 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-01-20 10:02:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:18,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:02:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:18,889 INFO L225 Difference]: With dead ends: 44 [2019-01-20 10:02:18,889 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 10:02:18,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 10:02:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-20 10:02:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:02:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-01-20 10:02:18,901 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-01-20 10:02:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:18,901 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-01-20 10:02:18,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-01-20 10:02:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:18,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:18,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:18,902 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-20 10:02:18,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:18,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:18,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:19,150 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-20 10:02:19,173 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-20 10:02:19,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:19,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:19,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:19,174 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-20 10:02:19,175 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:19,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:19,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:19,179 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:19,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:19,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:19,179 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-20 10:02:19,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:19,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:19,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:19,212 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-20 10:02:19,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,216 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-20 10:02:19,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,220 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-20 10:02:19,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,231 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-20 10:02:19,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,290 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-20 10:02:19,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:19,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:02:19,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,370 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-20 10:02:19,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:19,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:19,419 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:19,420 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-20 10:02:19,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,447 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-20 10:02:19,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:19,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:19,486 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-20 10:02:19,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:19,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:19,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:19,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:19,506 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-01-20 10:02:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:19,804 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-01-20 10:02:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:19,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:02:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:19,811 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:02:19,812 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:02:19,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:02:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-01-20 10:02:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 10:02:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-01-20 10:02:19,824 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-01-20 10:02:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-01-20 10:02:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-01-20 10:02:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:19,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:19,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:19,826 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-20 10:02:19,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:19,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:19,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:19,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:19,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:20,061 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-20 10:02:20,071 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-20 10:02:20,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:20,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:20,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:20,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:20,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:20,072 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-20 10:02:20,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:20,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:20,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:02:20,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:20,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:20,097 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-20 10:02:20,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,101 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-20 10:02:20,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,105 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-20 10:02:20,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,124 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-20 10:02:20,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:20,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:20,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:20,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:20,172 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-20 10:02:20,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:20,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:20,365 INFO L303 Elim1Store]: Index analysis took 176 ms [2019-01-20 10:02:20,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:02:20,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:20,754 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-20 10:02:20,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:20,967 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-20 10:02:21,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:21,201 INFO L303 Elim1Store]: Index analysis took 226 ms [2019-01-20 10:02:21,203 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-20 10:02:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:21,525 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-20 10:02:21,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:21,541 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-20 10:02:21,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:21,563 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-20 10:02:21,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:21,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:21,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:21,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:21,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:21,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:21,583 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-01-20 10:02:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:22,160 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-01-20 10:02:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:22,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:02:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:22,164 INFO L225 Difference]: With dead ends: 58 [2019-01-20 10:02:22,164 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:02:22,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:02:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-01-20 10:02:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:02:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-01-20 10:02:22,179 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-01-20 10:02:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:22,179 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-01-20 10:02:22,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-01-20 10:02:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:22,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:22,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:22,180 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-01-20 10:02:22,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:22,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:22,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:22,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:22,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:22,253 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-20 10:02:22,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:22,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:22,253 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:22,253 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-01-20 10:02:22,254 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:22,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:22,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:22,257 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:22,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:22,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:22,258 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-20 10:02:22,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:22,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:22,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:22,279 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-20 10:02:22,283 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-20 10:02:22,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,289 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:02:22,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:22,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:22,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:22,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:22,332 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-20 10:02:22,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:22,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,373 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-20 10:02:22,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:22,389 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-20 10:02:22,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:22,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:22,560 INFO L303 Elim1Store]: Index analysis took 152 ms [2019-01-20 10:02:22,561 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-20 10:02:22,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:22,841 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-20 10:02:22,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:02:23,011 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-20 10:02:23,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:23,375 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-20 10:02:23,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:23,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:23,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:23,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:23,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:23,433 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-01-20 10:02:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:24,028 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-01-20 10:02:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:24,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:02:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:24,029 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:02:24,029 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:02:24,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:02:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-01-20 10:02:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:02:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-01-20 10:02:24,040 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-01-20 10:02:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:24,041 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-01-20 10:02:24,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-01-20 10:02:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:24,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:24,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:24,042 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-01-20 10:02:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:24,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:24,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:24,096 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-20 10:02:24,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:24,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:24,097 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-01-20 10:02:24,098 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:24,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:24,103 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:24,103 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:24,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:24,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:24,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,104 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-20 10:02:24,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:24,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:24,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:24,121 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-20 10:02:24,127 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-20 10:02:24,134 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-20 10:02:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-20 10:02:24,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,177 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-20 10:02:24,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-01-20 10:02:24,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,205 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-20 10:02:24,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,214 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-20 10:02:24,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-20 10:02:24,224 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-20 10:02:24,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:24,228 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-20 10:02:24,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:02:24,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:02:24,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:02:24,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:02:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:02:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:02:24,248 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-01-20 10:02:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:24,503 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-01-20 10:02:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:02:24,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:02:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:24,505 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:02:24,505 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:02:24,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:02:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:02:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-01-20 10:02:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:02:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-01-20 10:02:24,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-01-20 10:02:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:24,529 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-01-20 10:02:24,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:02:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-01-20 10:02:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:02:24,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:24,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:02:24,530 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-01-20 10:02:24,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:24,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:24,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:24,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:24,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:24,685 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-20 10:02:24,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:24,686 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:02:24,686 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-20 10:02:24,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:24,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:24,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:24,691 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:24,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:24,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:02:24,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:24,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:24,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:24,716 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-20 10:02:24,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,720 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-20 10:02:24,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,732 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-20 10:02:24,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,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-20 10:02:24,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,785 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-20 10:02:24,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:24,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:24,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:02:24,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,838 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-20 10:02:24,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,029 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:25,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:25,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:25,059 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-20 10:02:25,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:25,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,086 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-20 10:02:25,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:25,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-20 10:02:25,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:25,130 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-20 10:02:25,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:25,157 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-20 10:02:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:25,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:02:25,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:25,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:25,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:25,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:25,178 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-01-20 10:02:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:25,633 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-01-20 10:02:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:25,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:02:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:25,635 INFO L225 Difference]: With dead ends: 105 [2019-01-20 10:02:25,635 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:02:25,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:02:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:02:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-01-20 10:02:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:02:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-01-20 10:02:25,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-01-20 10:02:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:25,653 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-01-20 10:02:25,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-01-20 10:02:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:25,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:25,654 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:02:25,654 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:25,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:25,654 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-01-20 10:02:25,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:25,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:25,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:25,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:25,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:02:25,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:25,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:25,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:25,762 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-20 10:02:25,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:25,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:25,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:25,766 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:25,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:25,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:25,767 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-20 10:02:25,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:25,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:25,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:25,786 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-20 10:02:25,794 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-20 10:02:25,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-20 10:02:25,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-20 10:02:25,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:25,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:25,867 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:25,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:25,892 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-20 10:02:25,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-20 10:02:25,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:25,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:02:25,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:26,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:26,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-20 10:02:26,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-20 10:02:26,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:26,274 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-20 10:02:26,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-20 10:02:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:26,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:26,332 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-20 10:02:26,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:26,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:02:26,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:26,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:02:26,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:02:26,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:02:26,353 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-01-20 10:02:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:26,508 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-01-20 10:02:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:26,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-20 10:02:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:26,509 INFO L225 Difference]: With dead ends: 85 [2019-01-20 10:02:26,510 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:02:26,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:02:26,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-20 10:02:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:02:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-20 10:02:26,530 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-20 10:02:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:26,530 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-20 10:02:26,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:02:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-20 10:02:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:26,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:26,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:26,531 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-20 10:02:26,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:26,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:26,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:26,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:26,631 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-20 10:02:26,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:26,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:26,631 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:26,632 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-20 10:02:26,633 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:26,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:26,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:26,640 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:26,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:26,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:26,641 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-20 10:02:26,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:26,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:26,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:26,674 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-20 10:02:26,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,679 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-20 10:02:26,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,685 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-20 10:02:26,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:26,718 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-20 10:02:26,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:26,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:26,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:26,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:26,982 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-20 10:02:26,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:27,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,058 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-20 10:02:27,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:27,085 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-20 10:02:27,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:27,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,152 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-20 10:02:27,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:27,180 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-20 10:02:27,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:27,197 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-20 10:02:27,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:27,220 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-20 10:02:27,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:27,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:27,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:27,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:27,240 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-01-20 10:02:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:27,468 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-01-20 10:02:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:27,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:02:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:27,470 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:02:27,470 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:02:27,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-20 10:02:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:02:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-01-20 10:02:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:02:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-20 10:02:27,488 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-20 10:02:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:27,488 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-20 10:02:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-20 10:02:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:27,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:27,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:27,489 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-20 10:02:27,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:27,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:27,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:27,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:27,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:27,602 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-20 10:02:27,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:27,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:27,603 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:27,603 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-20 10:02:27,604 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:27,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:27,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:27,607 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:27,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:27,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:27,608 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-20 10:02:27,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:27,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:27,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:27,657 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-20 10:02:27,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,700 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-20 10:02:27,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,763 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-20 10:02:27,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,834 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-20 10:02:27,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:27,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:27,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:27,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:27,894 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-20 10:02:27,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:27,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,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 45 [2019-01-20 10:02:27,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:27,955 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-20 10:02:27,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:27,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:27,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,004 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-20 10:02:28,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:28,034 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-20 10:02:28,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:28,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,061 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:28,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,063 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-20 10:02:28,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:28,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:28,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:28,117 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-20 10:02:28,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:28,180 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-20 10:02:28,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:28,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:02:28,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:28,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:28,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:28,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:28,199 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-20 10:02:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:28,698 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-01-20 10:02:28,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:28,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:02:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:28,700 INFO L225 Difference]: With dead ends: 97 [2019-01-20 10:02:28,700 INFO L226 Difference]: Without dead ends: 96 [2019-01-20 10:02:28,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-20 10:02:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-01-20 10:02:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:02:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-20 10:02:28,719 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-20 10:02:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:28,719 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-20 10:02:28,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-20 10:02:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:28,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:28,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:28,721 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-20 10:02:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:28,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:28,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:28,898 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-20 10:02:28,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:28,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:28,898 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:28,899 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-20 10:02:28,899 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:28,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:28,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:28,902 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:28,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:28,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:28,903 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-20 10:02:28,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:28,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:28,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:28,921 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-20 10:02:28,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,925 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-20 10:02:28,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,932 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-20 10:02:28,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:28,944 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-20 10:02:28,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:28,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:28,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:28,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:28,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:28,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:29,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:02:29,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:29,051 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-20 10:02:29,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:29,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,085 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-20 10:02:29,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:29,116 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-20 10:02:29,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:29,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:29,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:29,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 33 treesize of output 77 [2019-01-20 10:02:29,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:29,182 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-20 10:02:29,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:29,201 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-20 10:02:29,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:29,246 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-20 10:02:29,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:29,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:29,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:29,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:29,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:29,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:29,265 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-20 10:02:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:29,650 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-01-20 10:02:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:29,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:02:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:29,652 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:02:29,652 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:02:29,653 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-20 10:02:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:02:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-01-20 10:02:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:02:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-01-20 10:02:29,691 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-01-20 10:02:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:29,691 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-01-20 10:02:29,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-01-20 10:02:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:29,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:29,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:29,692 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-01-20 10:02:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:29,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:29,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:29,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:29,944 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-20 10:02:29,986 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-20 10:02:29,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:29,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:29,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:29,987 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-01-20 10:02:29,990 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:29,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:29,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:29,993 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:29,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:29,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:29,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:02:30,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:30,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:30,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:30,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 10:02:30,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-20 10:02:30,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:30,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:02:30,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:30,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:30,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:30,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:30,069 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-20 10:02:30,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:30,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,099 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-20 10:02:30,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:30,114 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-20 10:02:30,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:30,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,134 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:30,135 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-20 10:02:30,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:30,151 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-20 10:02:30,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-01-20 10:02:30,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,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 30 treesize of output 44 [2019-01-20 10:02:30,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02: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-20 10:02:30,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-20 10:02:30,208 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-20 10:02:30,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:30,242 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-20 10:02:30,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:30,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:30,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:30,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:30,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:30,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:30,262 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-01-20 10:02:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:30,686 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-01-20 10:02:30,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:02:30,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:02:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:30,689 INFO L225 Difference]: With dead ends: 108 [2019-01-20 10:02:30,689 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:02:30,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:02:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-01-20 10:02:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:02:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-01-20 10:02:30,715 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-01-20 10:02:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:30,716 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-01-20 10:02:30,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-01-20 10:02:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:30,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:30,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:30,717 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-01-20 10:02:30,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:30,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:30,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:30,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:30,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:30,921 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-20 10:02:30,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:30,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:30,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:30,922 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-20 10:02:30,923 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:30,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:30,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:30,925 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:02:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:30,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:30,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:30,926 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-20 10:02:30,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:30,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:30,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:30,942 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-20 10:02:30,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,948 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-20 10:02:30,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,955 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-20 10:02:30,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:30,965 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-20 10:02:30,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:30,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:31,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:31,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,093 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-20 10:02:31,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:31,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:31,122 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-20 10:02:31,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,150 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-20 10:02:31,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:31,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:31,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,223 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-20 10:02:31,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:02:31,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:31,318 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:31,319 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-20 10:02:31,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,357 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-20 10:02:31,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:02:31,374 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-20 10:02:31,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:31,468 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-20 10:02:31,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:31,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:02:31,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:31,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:02:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:02:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:31,488 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-01-20 10:02:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:32,911 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-01-20 10:02:32,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:32,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:02:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:32,913 INFO L225 Difference]: With dead ends: 120 [2019-01-20 10:02:32,913 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:02:32,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:02:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:02:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-01-20 10:02:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-20 10:02:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-01-20 10:02:32,936 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-01-20 10:02:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:32,936 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-01-20 10:02:32,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:02:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-01-20 10:02:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:32,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:32,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:32,938 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-01-20 10:02:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:32,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:33,103 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-20 10:02:33,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:33,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:33,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:33,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:33,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:33,104 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-20 10:02:33,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:33,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:33,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:02:33,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:33,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:33,126 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-20 10:02:33,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,134 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-20 10:02:33,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,141 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-20 10:02:33,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,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 22 treesize of output 45 [2019-01-20 10:02:33,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,225 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-20 10:02:33,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:33,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:33,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,282 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-20 10:02:33,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:33,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:33,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,368 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:33,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:33,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:33,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:33,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,432 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:33,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:33,434 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-20 10:02:33,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,467 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-20 10:02:33,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:33,484 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-20 10:02:33,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:33,541 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-20 10:02:33,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:33,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:02:33,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:33,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:02:33,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:02:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:02:33,561 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-01-20 10:02:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:34,157 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-01-20 10:02:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:34,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:02:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:34,159 INFO L225 Difference]: With dead ends: 146 [2019-01-20 10:02:34,160 INFO L226 Difference]: Without dead ends: 145 [2019-01-20 10:02:34,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:02:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-20 10:02:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-01-20 10:02:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:02:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-01-20 10:02:34,184 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-01-20 10:02:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:34,185 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-01-20 10:02:34,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:02:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-01-20 10:02:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:34,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:34,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:34,186 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-20 10:02:34,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:34,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:34,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:34,369 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-20 10:02:34,386 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-20 10:02:34,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:34,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:34,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:34,387 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-20 10:02:34,388 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:34,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:34,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:34,390 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:34,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:34,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:34,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:34,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 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-20 10:02:34,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:34,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:34,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:34,411 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-20 10:02:34,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,416 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-20 10:02:34,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,421 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-20 10:02:34,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,426 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-20 10:02:34,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:34,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:34,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:34,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:34,475 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-20 10:02:34,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:34,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,508 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-20 10:02:34,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:34,533 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-20 10:02:34,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:34,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:34,565 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-20 10:02:34,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:34,599 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-20 10:02:34,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:34,617 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-20 10:02:34,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:34,635 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-20 10:02:34,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:34,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:02:34,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:34,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:02:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:02:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:02:34,655 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-01-20 10:02:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:34,876 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-01-20 10:02:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:34,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-20 10:02:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:34,879 INFO L225 Difference]: With dead ends: 111 [2019-01-20 10:02:34,879 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 10:02:34,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 10:02:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-01-20 10:02:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:02:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-01-20 10:02:34,910 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-01-20 10:02:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:34,911 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-01-20 10:02:34,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:02:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-01-20 10:02:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:34,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:34,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:34,912 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-20 10:02:34,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:34,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:34,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:35,091 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-20 10:02:35,135 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-20 10:02:35,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:35,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:35,136 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:35,136 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-20 10:02:35,137 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:35,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:35,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:35,141 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:35,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:35,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:35,142 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-20 10:02:35,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:35,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:35,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:35,157 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-20 10:02:35,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,159 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-20 10:02:35,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,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, 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-20 10:02:35,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,213 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-20 10:02:35,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:35,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:35,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:35,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:35,264 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-20 10:02:35,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:35,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,292 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-20 10:02:35,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:35,344 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-20 10:02:35,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:35,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,374 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:35,377 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-20 10:02:35,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:35,407 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-20 10:02:35,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:35,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:35,438 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-20 10:02:35,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:35,520 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-20 10:02:35,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:35,539 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-20 10:02:35,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:35,566 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-20 10:02:35,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:35,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:02:35,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:35,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:35,586 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-01-20 10:02:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:36,062 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-01-20 10:02:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:36,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:02:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:36,064 INFO L225 Difference]: With dead ends: 153 [2019-01-20 10:02:36,065 INFO L226 Difference]: Without dead ends: 152 [2019-01-20 10:02:36,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-20 10:02:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-01-20 10:02:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-20 10:02:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-01-20 10:02:36,095 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-01-20 10:02:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:36,095 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-01-20 10:02:36,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-01-20 10:02:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:36,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:36,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:36,096 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-20 10:02:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:36,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:36,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:36,267 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-20 10:02:36,293 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-20 10:02:36,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:36,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:36,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:36,294 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-20 10:02:36,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:36,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:36,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:36,298 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:36,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:36,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:36,299 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-20 10:02:36,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:36,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:36,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:36,315 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-20 10:02:36,320 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-20 10:02:36,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:36,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,375 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-20 10:02:36,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:36,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:36,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:36,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:36,412 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-20 10:02:36,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:36,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,440 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-20 10:02:36,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:36,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:36,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:36,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:36,476 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:36,477 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-20 10:02:36,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:36,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:36,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:02:36,510 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-20 10:02:36,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:36,544 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-20 10:02:36,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:36,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:36,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:36,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:36,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:36,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:36,564 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-01-20 10:02:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:36,795 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-01-20 10:02:36,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:36,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:02:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:36,797 INFO L225 Difference]: With dead ends: 143 [2019-01-20 10:02:36,798 INFO L226 Difference]: Without dead ends: 138 [2019-01-20 10:02:36,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-20 10:02:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-01-20 10:02:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-20 10:02:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-01-20 10:02:36,829 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-01-20 10:02:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:36,829 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-01-20 10:02:36,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-01-20 10:02:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:36,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:36,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:36,831 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-20 10:02:36,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:36,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:36,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:37,002 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-20 10:02:37,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:37,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:37,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:37,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:37,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:37,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:02:37,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:37,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:37,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:02:37,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:37,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:37,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:02:37,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,027 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-20 10:02:37,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:02:37,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,037 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-20 10:02:37,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:37,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:37,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:37,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:37,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:37,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:37,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:37,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:37,140 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-20 10:02:37,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:37,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,171 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-20 10:02:37,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:37,208 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-20 10:02:37,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:37,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:37,241 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:37,242 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-20 10:02:37,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:37,275 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-20 10:02:37,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:37,296 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-20 10:02:37,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:37,362 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-20 10:02:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:37,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:02:37,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:37,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:37,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:37,383 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-01-20 10:02:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:37,809 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-01-20 10:02:37,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:02:37,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:02:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:37,812 INFO L225 Difference]: With dead ends: 196 [2019-01-20 10:02:37,812 INFO L226 Difference]: Without dead ends: 195 [2019-01-20 10:02:37,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:02:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-20 10:02:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-01-20 10:02:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-20 10:02:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-01-20 10:02:37,854 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-01-20 10:02:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:37,854 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-01-20 10:02:37,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-01-20 10:02:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:37,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:37,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:37,855 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-01-20 10:02:37,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:37,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:37,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:38,051 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-20 10:02:38,124 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-20 10:02:38,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:38,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:38,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:38,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:38,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:38,124 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-20 10:02:38,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:38,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:38,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:38,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:38,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:38,145 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-20 10:02:38,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,149 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-20 10:02:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:02:38,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,160 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-20 10:02:38,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:38,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:02:38,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,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-20 10:02:38,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:38,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,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, 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-20 10:02:38,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,319 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-20 10:02:38,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:38,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:38,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-20 10:02:38,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,387 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-20 10:02:38,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:38,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:38,418 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:38,419 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-20 10:02:38,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:38,456 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-20 10:02:38,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:38,477 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-20 10:02:38,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:38,520 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-20 10:02:38,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:38,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:02:38,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:38,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:02:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:02:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:38,540 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-01-20 10:02:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:39,035 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-01-20 10:02:39,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:02:39,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:02:39,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:39,038 INFO L225 Difference]: With dead ends: 205 [2019-01-20 10:02:39,038 INFO L226 Difference]: Without dead ends: 197 [2019-01-20 10:02:39,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:02:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-20 10:02:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-01-20 10:02:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-20 10:02:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-20 10:02:39,079 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-20 10:02:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:39,080 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-20 10:02:39,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:02:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-20 10:02:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:39,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:39,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:39,081 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-20 10:02:39,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:39,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:39,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:39,167 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-20 10:02:39,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:39,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:39,168 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:39,168 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-20 10:02:39,169 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:39,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:39,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:39,171 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:39,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:39,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:39,172 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-20 10:02:39,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:39,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:39,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:39,189 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-20 10:02:39,191 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-20 10:02:39,198 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-20 10:02:39,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:39,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-20 10:02:39,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:39,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:39,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:39,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:39,244 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-20 10:02:39,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-20 10:02:39,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:39,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:39,277 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-20 10:02:39,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:39,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:39,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-20 10:02:39,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:39,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:39,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:39,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:39,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-20 10:02:39,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:39,309 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-20 10:02:39,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-20 10:02:39,319 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-20 10:02:39,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:39,337 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-20 10:02:39,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:39,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:39,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:39,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:39,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:39,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:39,358 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-20 10:02:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:39,536 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-01-20 10:02:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:39,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:02:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:39,542 INFO L225 Difference]: With dead ends: 165 [2019-01-20 10:02:39,542 INFO L226 Difference]: Without dead ends: 164 [2019-01-20 10:02:39,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-20 10:02:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-20 10:02:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-01-20 10:02:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-20 10:02:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-20 10:02:39,580 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-20 10:02:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:39,580 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-20 10:02:39,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-20 10:02:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:02:39,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:39,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:02:39,581 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:39,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:39,581 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-01-20 10:02:39,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:39,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:39,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:39,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:39,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:39,828 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-20 10:02:40,142 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-20 10:02:40,314 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-20 10:02:40,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:40,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:40,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:02:40,315 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-01-20 10:02:40,316 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:40,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:40,318 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:40,319 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:40,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:40,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:40,319 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-20 10:02:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:40,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:40,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:40,370 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-20 10:02:40,409 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-20 10:02:40,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:40,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,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, 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-20 10:02:40,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:40,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:40,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:40,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:40,504 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-20 10:02:40,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:40,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,532 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-20 10:02:40,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:40,548 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-20 10:02:40,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:40,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:40,570 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 48 [2019-01-20 10:02:40,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02: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-20 10:02:40,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:40,606 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-20 10:02:40,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:40,625 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-20 10:02:40,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:40,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:40,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:40,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:40,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:40,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:40,645 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-20 10:02:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:40,884 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-01-20 10:02:40,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:40,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:02:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:40,886 INFO L225 Difference]: With dead ends: 174 [2019-01-20 10:02:40,887 INFO L226 Difference]: Without dead ends: 173 [2019-01-20 10:02:40,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-20 10:02:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-01-20 10:02:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-20 10:02:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-01-20 10:02:40,921 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-01-20 10:02:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:40,921 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-01-20 10:02:40,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-01-20 10:02:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:40,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:40,922 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:02:40,923 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-01-20 10:02:40,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:40,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:40,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:40,971 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-20 10:02:40,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:40,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:40,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:40,972 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-01-20 10:02:40,972 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:40,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:40,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:40,977 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:02:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:40,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:40,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:40,977 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-20 10:02:40,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:40,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:40,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:41,000 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-20 10:02:41,006 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-20 10:02:41,013 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-20 10:02:41,032 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-20 10:02:41,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,080 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-20 10:02:41,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-01-20 10:02:41,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-20 10:02:41,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:02:41,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,169 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-20 10:02:41,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:41,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-20 10:02:41,176 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-20 10:02:41,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:41,189 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-20 10:02:41,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:02:41,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-01-20 10:02:41,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:02:41,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:02:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:02:41,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:02:41,209 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-01-20 10:02:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:41,358 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-01-20 10:02:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:02:41,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-20 10:02:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:41,362 INFO L225 Difference]: With dead ends: 357 [2019-01-20 10:02:41,362 INFO L226 Difference]: Without dead ends: 353 [2019-01-20 10:02:41,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:02:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-20 10:02:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-01-20 10:02:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-20 10:02:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-01-20 10:02:41,501 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-01-20 10:02:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:41,502 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-01-20 10:02:41,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:02:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-01-20 10:02:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:41,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:41,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:41,503 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-01-20 10:02:41,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:41,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:41,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:41,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:41,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:41,759 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-20 10:02:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:41,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:41,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:41,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:41,785 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-20 10:02:41,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:41,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:41,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:41,789 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:41,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:41,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:41,792 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-20 10:02:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:41,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:41,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:41,812 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-20 10:02:41,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 10:02:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,890 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-20 10:02:41,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:41,973 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-20 10:02:41,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,121 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-20 10:02:42,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:42,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,145 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-20 10:02:42,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,170 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-20 10:02:42,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:42,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:42,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:42,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:42,227 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-20 10:02:42,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:42,243 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-20 10:02:42,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:42,264 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-20 10:02:42,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:42,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:02:42,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:42,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:42,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:42,283 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-01-20 10:02:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:42,555 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-01-20 10:02:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:42,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:02:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:42,561 INFO L225 Difference]: With dead ends: 348 [2019-01-20 10:02:42,561 INFO L226 Difference]: Without dead ends: 338 [2019-01-20 10:02:42,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-20 10:02:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-20 10:02:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-01-20 10:02:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-20 10:02:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-01-20 10:02:42,648 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-01-20 10:02:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:42,648 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-01-20 10:02:42,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-01-20 10:02:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:42,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:42,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:42,649 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-20 10:02:42,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:42,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:42,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:42,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:42,909 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-20 10:02:42,977 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-20 10:02:42,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:42,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:42,978 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:42,978 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-20 10:02:42,979 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:42,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:42,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:42,981 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:42,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:42,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:42,982 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-20 10:02:42,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:42,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:42,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:43,003 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-20 10:02:43,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 10:02:43,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,018 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-20 10:02:43,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,026 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-20 10:02:43,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:43,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,157 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-20 10:02:43,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,183 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-20 10:02:43,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:43,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:43,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,244 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-20 10:02:43,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:43,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,274 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:43,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:43,276 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-20 10:02:43,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,308 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-20 10:02:43,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:43,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:43,395 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-20 10:02:43,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:43,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:43,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:43,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:43,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:43,415 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-01-20 10:02:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:43,815 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-01-20 10:02:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:43,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:02:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:43,818 INFO L225 Difference]: With dead ends: 348 [2019-01-20 10:02:43,818 INFO L226 Difference]: Without dead ends: 343 [2019-01-20 10:02:43,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:02:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-20 10:02:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-01-20 10:02:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-20 10:02:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-01-20 10:02:43,940 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-01-20 10:02:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:43,940 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-01-20 10:02:43,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-01-20 10:02:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:43,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:43,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:43,942 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-20 10:02:43,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:43,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:44,618 WARN L181 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:02:44,695 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-20 10:02:44,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:44,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:44,695 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:44,695 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-20 10:02:44,696 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:44,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:44,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:44,699 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:02:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:44,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:44,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:44,699 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-20 10:02:44,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:44,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:44,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:44,716 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-20 10:02:44,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,722 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-20 10:02:44,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,725 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-20 10:02:44,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,732 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-20 10:02:44,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:44,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,808 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-20 10:02:44,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,834 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-20 10:02:44,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:44,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,865 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-20 10:02:44,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,914 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-20 10:02:44,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:44,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,945 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:44,946 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-20 10:02:44,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:44,978 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-20 10:02:44,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:44,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:44,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,006 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:45,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:45,008 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-20 10:02:45,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:45,164 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-20 10:02:45,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:45,186 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-20 10:02:45,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:45,230 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-20 10:02:45,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:45,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:02:45,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:45,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:02:45,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:02:45,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:45,249 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-01-20 10:02:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:45,846 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-01-20 10:02:45,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:02:45,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:02:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:45,852 INFO L225 Difference]: With dead ends: 457 [2019-01-20 10:02:45,852 INFO L226 Difference]: Without dead ends: 456 [2019-01-20 10:02:45,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:02:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-01-20 10:02:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-01-20 10:02:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-20 10:02:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-01-20 10:02:45,982 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-01-20 10:02:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:45,983 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-01-20 10:02:45,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:02:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-01-20 10:02:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:45,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:45,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:45,984 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-20 10:02:45,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:45,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:45,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:46,214 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-20 10:02:46,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:46,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:46,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:46,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:46,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:46,215 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-20 10:02:46,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:46,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:46,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:02:46,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:46,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:46,241 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-20 10:02:46,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,246 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-20 10:02:46,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,257 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-20 10:02:46,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,266 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-20 10:02:46,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:46,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,388 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-20 10:02:46,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,431 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-20 10:02:46,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:46,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,467 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:46,468 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-20 10:02:46,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,497 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-20 10:02:46,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:46,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,529 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-20 10:02:46,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,557 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-20 10:02:46,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-20 10:02:46,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:46,591 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:46,591 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-20 10:02:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:46,622 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-20 10:02:46,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:02:46,643 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-20 10:02:46,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:46,693 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-20 10:02:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:46,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:02:46,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:46,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:02:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:02:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:46,714 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-01-20 10:02:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:47,229 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-01-20 10:02:47,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:47,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:02:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:47,234 INFO L225 Difference]: With dead ends: 346 [2019-01-20 10:02:47,234 INFO L226 Difference]: Without dead ends: 345 [2019-01-20 10:02:47,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:02:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-20 10:02:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-01-20 10:02:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-20 10:02:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-01-20 10:02:47,304 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-01-20 10:02:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:47,304 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-01-20 10:02:47,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:02:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-01-20 10:02:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:47,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:47,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:47,305 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:47,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-01-20 10:02:47,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:47,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:47,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:47,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:47,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:47,452 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-20 10:02:47,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:47,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:47,453 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:47,453 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-20 10:02:47,454 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:47,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:47,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:47,457 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:47,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:47,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:47,458 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-20 10:02:47,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:47,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:47,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:47,475 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-20 10:02:47,481 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-20 10:02:47,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:47,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:02:47,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:47,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:47,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:47,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:47,532 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-20 10:02:47,532 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:47,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,560 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-20 10:02:47,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:47,575 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-20 10:02:47,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:47,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,593 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:47,593 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-20 10:02:47,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:47,610 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-20 10:02:47,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-01-20 10:02:47,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:47,632 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 44 [2019-01-20 10:02:47,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:47,649 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-20 10:02:47,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-20 10:02:47,666 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-20 10:02:47,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:47,692 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-20 10:02:47,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:47,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:02:47,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:47,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:47,713 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-01-20 10:02:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:48,072 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-01-20 10:02:48,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:48,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:02:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:48,074 INFO L225 Difference]: With dead ends: 280 [2019-01-20 10:02:48,074 INFO L226 Difference]: Without dead ends: 277 [2019-01-20 10:02:48,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-20 10:02:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-01-20 10:02:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-20 10:02:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-01-20 10:02:48,178 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-01-20 10:02:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:48,178 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-01-20 10:02:48,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-01-20 10:02:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:48,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:48,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:48,180 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:48,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-01-20 10:02:48,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:48,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:48,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:48,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:48,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:48,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:48,279 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-01-20 10:02:48,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:48,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:48,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:48,282 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:48,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:48,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:48,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:48,283 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-20 10:02:48,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:48,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:48,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:48,303 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-20 10:02:48,307 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-20 10:02:48,316 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-20 10:02:48,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:48,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-20 10:02:48,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:48,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:48,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:48,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:48,358 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-20 10:02:48,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-20 10:02:48,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:48,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:48,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:02:48,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:48,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:48,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-20 10:02:48,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:48,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:48,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:48,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:48,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:02:48,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:48,412 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-20 10:02:48,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-20 10:02:48,424 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-20 10:02:48,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:48,440 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-20 10:02:48,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:48,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:02:48,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:48,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:02:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:02:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:02:48,459 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-01-20 10:02:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:48,790 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-01-20 10:02:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:02:48,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:02:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:48,793 INFO L225 Difference]: With dead ends: 390 [2019-01-20 10:02:48,793 INFO L226 Difference]: Without dead ends: 377 [2019-01-20 10:02:48,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-20 10:02:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-01-20 10:02:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-20 10:02:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-01-20 10:02:48,917 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-01-20 10:02:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:48,917 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-01-20 10:02:48,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:02:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-01-20 10:02:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:48,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:48,919 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:02:48,919 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-01-20 10:02:48,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:48,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:48,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:49,096 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-20 10:02:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:02:49,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:49,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:49,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:49,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:49,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:49,187 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-20 10:02:49,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:49,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:49,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:49,208 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-20 10:02:49,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,211 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-20 10:02:49,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,214 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-20 10:02:49,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:02:49,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:49,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:02:49,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:49,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,360 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-20 10:02:49,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,392 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-20 10:02:49,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:49,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:49,425 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-20 10:02:49,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,457 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-20 10:02:49,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:49,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,493 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-20 10:02:49,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,526 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-20 10:02:49,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:02:49,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:49,562 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-20 10:02:49,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:49,598 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-20 10:02:49,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:49,618 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-20 10:02:49,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:49,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:49,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:02:49,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:49,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:02:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:02:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:02:49,726 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-01-20 10:02:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:50,327 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-01-20 10:02:50,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:02:50,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:02:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:50,331 INFO L225 Difference]: With dead ends: 375 [2019-01-20 10:02:50,331 INFO L226 Difference]: Without dead ends: 374 [2019-01-20 10:02:50,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:02:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-20 10:02:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-01-20 10:02:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-20 10:02:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-01-20 10:02:50,439 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-01-20 10:02:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:50,439 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-01-20 10:02:50,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:02:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-01-20 10:02:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:50,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:50,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:50,441 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-01-20 10:02:50,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:50,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:50,678 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-20 10:02:50,727 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-20 10:02:50,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:50,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:50,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:50,728 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-20 10:02:50,728 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:50,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:50,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:50,731 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:02:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:50,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:50,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:50,732 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-20 10:02:50,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:50,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:50,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:50,750 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-20 10:02:50,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,752 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-20 10:02:50,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,758 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-20 10:02:50,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,763 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-20 10:02:50,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:50,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:50,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:50,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:50,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-20 10:02:50,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:50,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,831 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-20 10:02:50,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:50,858 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-20 10:02:50,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:50,886 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-20 10:02:50,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:50,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:50,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:50,932 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-20 10:02:50,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:50,950 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-20 10:02:50,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:50,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:02:50,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:50,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:02:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:02:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:02:50,970 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-01-20 10:02:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:51,248 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-01-20 10:02:51,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:02:51,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:02:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:51,250 INFO L225 Difference]: With dead ends: 157 [2019-01-20 10:02:51,250 INFO L226 Difference]: Without dead ends: 150 [2019-01-20 10:02:51,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-20 10:02:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-20 10:02:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-20 10:02:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-01-20 10:02:51,366 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-01-20 10:02:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:51,366 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-01-20 10:02:51,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:02:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-01-20 10:02:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:51,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:51,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:51,367 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:51,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-20 10:02:51,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:51,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:51,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:51,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:51,552 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-20 10:02:51,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:51,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:51,553 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:02:51,553 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-20 10:02:51,554 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:51,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:51,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:51,557 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:51,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:51,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:51,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:51,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 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-20 10:02:51,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:51,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:51,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:51,591 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-20 10:02:51,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,594 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-20 10:02:51,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,598 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-20 10:02:51,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:02:51,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:51,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:51,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:51,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:51,728 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-20 10:02:51,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:51,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:51,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:51,785 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-20 10:02:51,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:51,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,814 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:51,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 59 [2019-01-20 10:02:51,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:51,844 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-20 10:02:51,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:51,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:51,870 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-20 10:02:51,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:51,900 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-20 10:02:51,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:51,920 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-20 10:02:51,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:51,972 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-20 10:02:51,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:51,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:51,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:51,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:51,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:51,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:51,992 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-01-20 10:02:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:52,493 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-01-20 10:02:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:02:52,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:02:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:52,496 INFO L225 Difference]: With dead ends: 206 [2019-01-20 10:02:52,496 INFO L226 Difference]: Without dead ends: 199 [2019-01-20 10:02:52,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:02:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-20 10:02:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-01-20 10:02:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-20 10:02:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-01-20 10:02:52,672 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-01-20 10:02:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:52,673 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-01-20 10:02:52,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-01-20 10:02:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:02:52,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:52,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:52,674 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-20 10:02:52,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:52,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:52,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:52,835 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-01-20 10:02:52,894 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-20 10:02:52,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:52,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:52,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:52,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:52,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:52,895 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-20 10:02:52,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:52,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:52,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:02:52,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:52,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:52,939 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-20 10:02:52,942 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-20 10:02:52,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:52,946 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-20 10:02:52,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:52,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:52,964 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-20 10:02:52,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:52,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:52,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:52,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,006 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-20 10:02:53,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-20 10:02:53,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:02:53,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,051 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-20 10:02:53,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:02:53,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,073 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-20 10:02:53,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,092 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-20 10:02:53,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-20 10:02:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,141 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:53,142 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-20 10:02:53,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,161 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-20 10:02:53,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:02:53,179 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-20 10:02:53,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:53,211 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-20 10:02:53,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:53,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:02:53,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:53,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:02:53,230 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-01-20 10:02:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:53,656 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-01-20 10:02:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:02:53,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:02:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:53,658 INFO L225 Difference]: With dead ends: 161 [2019-01-20 10:02:53,658 INFO L226 Difference]: Without dead ends: 156 [2019-01-20 10:02:53,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-20 10:02:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-01-20 10:02:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:02:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-01-20 10:02:53,721 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-01-20 10:02:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:53,721 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-01-20 10:02:53,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-01-20 10:02:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:02:53,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:53,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:53,722 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-01-20 10:02:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:53,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:53,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:53,874 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-20 10:02:53,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:53,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:53,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:02:53,874 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-20 10:02:53,875 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:53,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:53,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:53,877 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:53,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:53,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:53,878 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-20 10:02:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:53,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:53,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:53,895 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-20 10:02:53,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,898 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-20 10:02:53,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,903 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-20 10:02:53,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,910 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-20 10:02:53,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,954 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-20 10:02:53,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:53,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:53,981 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-20 10:02:53,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,007 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-20 10:02:54,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:54,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,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 31 treesize of output 57 [2019-01-20 10:02:54,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,066 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-20 10:02:54,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:54,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,096 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:54,097 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-20 10:02:54,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,129 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-20 10:02:54,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:54,147 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-20 10:02:54,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:54,182 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-20 10:02:54,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:54,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:02:54,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:54,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:02:54,201 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-01-20 10:02:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:54,565 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-01-20 10:02:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:02:54,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:02:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:54,567 INFO L225 Difference]: With dead ends: 62 [2019-01-20 10:02:54,567 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:02:54,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:02:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-20 10:02:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 10:02:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-20 10:02:54,665 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-20 10:02:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:54,665 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-20 10:02:54,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-20 10:02:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:02:54,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:54,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:54,666 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-01-20 10:02:54,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:54,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:54,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:54,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:54,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:54,816 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-20 10:02:54,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:54,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:54,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:02:54,816 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-01-20 10:02:54,817 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:54,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:54,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:54,820 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:54,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:54,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:54,821 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-20 10:02:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:54,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:54,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:54,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, 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-20 10:02:54,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,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, 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-20 10:02:54,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,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, 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-20 10:02:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,853 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-20 10:02:54,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:54,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,930 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-20 10:02:54,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:54,957 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-20 10:02:54,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:54,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:54,988 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-20 10:02:54,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:55,018 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-20 10:02:55,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:55,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,047 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:55,048 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-20 10:02:55,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:55,080 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-20 10:02:55,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:55,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:55,133 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-20 10:02:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:55,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-20 10:02:55,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:55,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:02:55,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:02:55,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:02:55,153 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-01-20 10:02:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:55,531 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-01-20 10:02:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:02:55,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-20 10:02:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:55,532 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:02:55,532 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:02:55,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:02:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:02:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-20 10:02:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 10:02:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-20 10:02:55,648 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-20 10:02:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:55,648 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-20 10:02:55,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:02:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-20 10:02:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:02:55,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:55,649 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:55,649 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:55,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-01-20 10:02:55,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:55,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:55,844 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-20 10:02:55,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:55,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:55,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:55,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:55,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:55,845 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-20 10:02:55,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:55,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:55,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:02:55,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:55,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:55,867 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-20 10:02:55,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,872 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-20 10:02:55,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,881 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-20 10:02:55,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,887 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-20 10:02:55,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:55,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:55,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:55,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:55,950 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-20 10:02:55,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:55,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:55,977 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-20 10:02:55,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:56,001 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-20 10:02:56,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:56,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:56,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:56,059 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-20 10:02:56,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:56,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,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-20 10:02:56,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:56,126 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-20 10:02:56,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:56,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:56,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:56,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:56,195 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-20 10:02:56,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:56,216 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-20 10:02:56,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:56,281 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-20 10:02:56,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:56,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-20 10:02:56,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:56,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:02:56,303 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-01-20 10:02:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:56,855 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-01-20 10:02:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:56,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:02:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:56,856 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:02:56,857 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 10:02:56,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:02:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 10:02:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-20 10:02:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:02:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-01-20 10:02:56,951 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-01-20 10:02:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:56,951 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-01-20 10:02:56,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-01-20 10:02:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:02:56,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:56,952 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:56,952 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:56,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-01-20 10:02:56,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:56,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:56,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:57,047 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-20 10:02:57,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:57,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:57,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:02:57,048 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-01-20 10:02:57,050 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:57,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:57,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:57,054 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:02:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:57,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:57,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:57,054 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-20 10:02:57,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:57,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:57,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:57,072 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-20 10:02:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,077 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-20 10:02:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,083 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-20 10:02:57,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,095 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-20 10:02:57,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,173 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-20 10:02:57,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:57,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,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, 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-20 10:02:57,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,239 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-20 10:02:57,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,273 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-20 10:02:57,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,302 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-20 10:02:57,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,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 31 treesize of output 65 [2019-01-20 10:02:57,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,363 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-20 10:02:57,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:57,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:57,394 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:57,395 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-20 10:02:57,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:57,429 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-20 10:02:57,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:57,447 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-20 10:02:57,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:57,486 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-20 10:02:57,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:57,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-20 10:02:57,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:57,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:02:57,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:02:57,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:02:57,506 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-01-20 10:02:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:57,874 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-01-20 10:02:57,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:57,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:02:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:57,875 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:02:57,875 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 10:02:57,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:02:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 10:02:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-20 10:02:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:02:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-01-20 10:02:57,990 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-01-20 10:02:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:57,991 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-01-20 10:02:57,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:02:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-01-20 10:02:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:02:57,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:57,991 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:57,992 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:57,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-01-20 10:02:57,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:57,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:57,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:57,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:57,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:02:58,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:58,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:58,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:58,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:58,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:58,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:58,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:58,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:02:58,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:58,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:58,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 10:02:58,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,134 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-20 10:02:58,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,139 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-20 10:02:58,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,145 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-20 10:02:58,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,195 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-20 10:02:58,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:58,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,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, 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-20 10:02:58,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,250 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-20 10:02:58,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:58,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,285 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-20 10:02:58,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:02:58,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:58,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,351 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:58,352 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-20 10:02:58,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,388 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-20 10:02:58,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:58,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:58,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-20 10:02:58,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:58,454 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-20 10:02:58,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:02:58,477 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-20 10:02:58,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:58,525 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-20 10:02:58,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:58,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:02:58,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:58,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:02:58,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:02:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:02:58,544 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-01-20 10:02:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:58,995 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-01-20 10:02:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:02:59,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:02:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:59,001 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:02:59,001 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:02:59,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:02:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:02:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-20 10:02:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:02:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-01-20 10:02:59,131 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-01-20 10:02:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:59,131 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-01-20 10:02:59,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:02:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-01-20 10:02:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:02:59,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:59,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:02:59,132 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-01-20 10:02:59,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:59,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:59,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:59,315 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-20 10:02:59,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:59,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:59,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:02:59,316 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-01-20 10:02:59,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:02:59,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:02:59,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:02:59,319 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:02:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:59,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:02:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:59,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:59,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:59,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:59,336 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-20 10:02:59,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,344 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-20 10:02:59,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,350 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-20 10:02:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,362 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-20 10:02:59,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:02:59,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:02:59,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,478 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-20 10:02:59,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:59,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,714 INFO L303 Elim1Store]: Index analysis took 210 ms [2019-01-20 10:02: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 31 treesize of output 65 [2019-01-20 10:02:59,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,750 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-20 10:02:59,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:02:59,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:59,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-20 10:02:59,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,822 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-20 10:02:59,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:02:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:02:59,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:02:59,858 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-20 10:02:59,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:59,894 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-20 10:02:59,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:02:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:59,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:00,031 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-20 10:03:00,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:03:00,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:00,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:03:00,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:03:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:03:00,052 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-01-20 10:03:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:00,602 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-01-20 10:03:00,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:03:00,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:03:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:00,603 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:03:00,603 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:03:00,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:03:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:03:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-20 10:03:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:03:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-01-20 10:03:00,757 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-01-20 10:03:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:00,757 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-01-20 10:03:00,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:03:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-01-20 10:03:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:03:00,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:00,758 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:03:00,758 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:00,758 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-01-20 10:03:00,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:00,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:00,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:03:01,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:01,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:01,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:01,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:01,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:01,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:01,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:01,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:01,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:03:01,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:01,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:01,023 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-20 10:03:01,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:03:01,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,030 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-20 10:03:01,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,034 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-20 10:03:01,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-20 10:03:01,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,123 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-20 10:03:01,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,150 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-20 10:03:01,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:03:01,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,240 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:03:01,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-20 10:03:01,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,271 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-20 10:03:01,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-20 10:03:01,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,301 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-20 10:03:01,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,329 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-20 10:03:01,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-01-20 10:03:01,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-20 10:03:01,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,398 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-20 10:03:01,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-20 10:03:01,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:03:01,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-20 10:03:01,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:01,504 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-20 10:03:01,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:03:01,541 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-20 10:03:01,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:01,713 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-20 10:03:01,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:01,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-01-20 10:03:01,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:01,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:03:01,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:03:01,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:03:01,732 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-01-20 10:03:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:02,365 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-01-20 10:03:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:03:02,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-20 10:03:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:02,365 INFO L225 Difference]: With dead ends: 48 [2019-01-20 10:03:02,366 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:03:02,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:03:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:03:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:03:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:03:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:03:02,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-20 10:03:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:02,368 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:03:02,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:03:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:03:02,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:03:02,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:03:02,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:02,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:03,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:04,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:05,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:06,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:07,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:08,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:08,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:08,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:08,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:08,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:09,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:09,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:09,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:09,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:10,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:10,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:10,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:10,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:10,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:10,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:10,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:11,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:11,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:11,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:12,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:03:12,458 WARN L181 SmtUtils]: Spent 10.08 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-01-20 10:03:26,067 WARN L181 SmtUtils]: Spent 13.60 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-01-20 10:03:26,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:03:26,069 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-20 10:03:26,069 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-20 10:03:26,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-01-20 10:03:26,070 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse18 (- 1)))) (.cse19 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (= .cse18 0)) (.cse5 (<= 0 .cse19)) (.cse2 (select .cse17 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse3 (= 0 (select .cse10 ULTIMATE.start_main_p1))) (.cse1 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse19 1)))) (or (and (and (and .cse0 .cse1) (<= 1 .cse2) .cse3) (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse5 (<= 0 .cse6) .cse7 (<= .cse8 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (let ((.cse11 (select .cse4 ULTIMATE.start_main_p2))) (let ((.cse14 (<= .cse18 0)) (.cse15 (<= (+ .cse11 1) 0)) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and (= 0 (select .cse9 ULTIMATE.start_main_p1)) (<= 1 (select .cse10 ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse11) .cse0 .cse7) (and (and .cse12 .cse13 .cse14 .cse5 .cse15 .cse3) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p3))) (and (and .cse14 (let ((.cse16 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select .cse17 ULTIMATE.start_main_p1)) .cse12))) (or (and .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse16) (and .cse15 .cse16)))) (<= 0 .cse2))))) (and .cse0 .cse3 .cse1 (= .cse19 0) .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select .cse9 ULTIMATE.start_main_p4) 1) 0)))))) [2019-01-20 10:03:26,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:03:26,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-01-20 10:03:26,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-01-20 10:03:26,070 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-01-20 10:03:26,070 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-20 10:03:26,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-01-20 10:03:26,086 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:03:26 BoogieIcfgContainer [2019-01-20 10:03:26,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-20 10:03:26,087 INFO L168 Benchmark]: Toolchain (without parser) took 84510.25 ms. Allocated memory was 140.5 MB in the beginning and 780.7 MB in the end (delta: 640.2 MB). Free memory was 108.0 MB in the beginning and 99.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 703.0 MB. Max. memory is 7.1 GB. [2019-01-20 10:03:26,088 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:03:26,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.97 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:03:26,088 INFO L168 Benchmark]: Boogie Preprocessor took 24.12 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 104.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:03:26,088 INFO L168 Benchmark]: RCFGBuilder took 445.30 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 93.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-01-20 10:03:26,089 INFO L168 Benchmark]: TraceAbstraction took 83988.69 ms. Allocated memory was 140.5 MB in the beginning and 780.7 MB in the end (delta: 640.2 MB). Free memory was 93.7 MB in the beginning and 99.0 MB in the end (delta: -5.4 MB). Peak memory consumption was 688.7 MB. Max. memory is 7.1 GB. [2019-01-20 10:03:26,090 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.18 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.97 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.12 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 104.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 445.30 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 93.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83988.69 ms. Allocated memory was 140.5 MB in the beginning and 780.7 MB in the end (delta: 640.2 MB). Free memory was 93.7 MB in the beginning and 99.0 MB in the end (delta: -5.4 MB). Peak memory consumption was 688.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: 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: 31]: Loop Invariant Derived loop invariant: ((((((p1 + 3 <= p4 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2)) || ((((((0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p2 == p4)) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && p1 + 3 <= p4) && #memory_int[p4] == 0) || ((((((!(p1 == p4) && !(p1 == p3)) && #memory_int[p4] <= 0) && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && !(p4 == p3))) || ((#memory_int[p4] <= 0 && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)))) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3])) || ((((((p1 + 3 <= p4 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 83.9s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 23.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 32.7s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...