java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:34:11,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:34:11,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:34:11,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:34:11,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:34:11,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:34:11,957 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:34:11,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:34:11,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:34:11,969 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:34:11,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:34:11,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:34:11,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:34:11,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:34:11,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:34:11,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:34:11,984 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:34:11,986 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:34:11,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:34:11,993 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:34:11,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:34:11,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:34:11,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:34:12,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:34:12,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:34:12,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:34:12,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:34:12,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:34:12,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:34:12,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:34:12,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:34:12,010 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:34:12,010 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:34:12,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:34:12,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:34:12,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:34:12,014 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 17:34:12,035 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:34:12,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:34:12,038 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:34:12,038 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:34:12,038 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:34:12,038 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:34:12,039 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:34:12,039 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:34:12,040 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:34:12,040 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:34:12,040 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:34:12,040 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:34:12,040 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:34:12,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:34:12,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:34:12,042 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:34:12,043 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:34:12,044 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:34:12,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:34:12,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:34:12,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:34:12,044 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:34:12,045 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:34:12,046 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:34:12,046 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:34:12,046 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:34:12,046 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:34:12,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:34:12,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:34:12,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:34:12,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:12,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:34:12,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:34:12,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:34:12,048 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:34:12,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:34:12,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:34:12,049 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:34:12,049 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:34:12,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:34:12,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:34:12,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:34:12,108 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:34:12,109 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:34:12,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-01-31 17:34:12,110 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-31 17:34:12,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:34:12,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:34:12,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:12,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:34:12,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:34:12,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:12,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:34:12,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:34:12,212 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:34:12,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/1) ... [2019-01-31 17:34:12,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:34:12,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:34:12,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:34:12,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:34:12,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:12,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:34:12,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:34:12,530 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:34:12,530 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-31 17:34:12,532 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:12 BoogieIcfgContainer [2019-01-31 17:34:12,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:34:12,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:34:12,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:34:12,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:34:12,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:12" (1/2) ... [2019-01-31 17:34:12,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b33d2a7 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:34:12, skipping insertion in model container [2019-01-31 17:34:12,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:12" (2/2) ... [2019-01-31 17:34:12,540 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-31 17:34:12,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:34:12,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-31 17:34:12,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-31 17:34:12,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:34:12,605 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:34:12,605 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:34:12,605 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:34:12,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:34:12,605 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:34:12,606 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:34:12,606 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:34:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-31 17:34:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:34:12,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:12,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:34:12,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-31 17:34:12,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:12,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:12,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:12,804 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-31 17:34:12,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:12,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:12,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:12,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:12,834 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-31 17:34:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:13,047 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-31 17:34:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:13,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:34:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:13,061 INFO L225 Difference]: With dead ends: 17 [2019-01-31 17:34:13,061 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:34:13,065 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-31 17:34:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:34:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-31 17:34:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:34:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-31 17:34:13,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-31 17:34:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:13,101 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-31 17:34:13,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-31 17:34:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:13,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:13,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:13,103 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-31 17:34:13,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:13,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:13,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:13,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:13,139 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-31 17:34:13,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:13,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:13,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:13,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:13,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:13,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:13,143 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-31 17:34:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:13,237 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 17:34:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:13,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:34:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:13,238 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:34:13,239 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:34:13,240 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-31 17:34:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:34:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-31 17:34:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 17:34:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-31 17:34:13,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-31 17:34:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:13,244 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-31 17:34:13,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-31 17:34:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:13,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:13,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:13,245 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-31 17:34:13,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:13,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:13,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:13,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:13,348 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-31 17:34:13,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:13,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:13,351 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:13,352 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-31 17:34:13,397 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:13,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:14,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:14,388 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:14,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:14,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:14,395 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-31 17:34:14,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:14,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:14,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:14,637 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-31 17:34:14,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:14,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:14,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:14,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:14,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:14,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:14,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:14,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:14,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-31 17:34:14,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:14,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:15,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:15,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:15,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:15,128 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:15,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:15,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:34:15,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:15,233 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-31 17:34:15,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:15,254 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-31 17:34:15,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:15,263 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-31 17:34:15,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:15,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:34:15,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:15,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:15,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:15,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:15,286 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-31 17:34:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:15,471 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-31 17:34:15,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:15,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:34:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:15,473 INFO L225 Difference]: With dead ends: 13 [2019-01-31 17:34:15,473 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:34:15,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:34:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-31 17:34:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:34:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-31 17:34:15,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-31 17:34:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:15,477 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-31 17:34:15,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-31 17:34:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:15,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:15,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:15,478 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:15,479 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-31 17:34:15,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:15,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:15,525 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-31 17:34:15,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:15,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:15,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:15,526 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-31 17:34:15,528 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:15,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:15,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:15,874 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:15,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:15,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:15,875 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-31 17:34:15,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:15,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:15,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:16,024 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-31 17:34:16,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:16,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:16,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:16,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:16,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:16,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:16,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:16,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:16,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-31 17:34:16,117 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:16,118 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:16,191 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:16,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:16,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:16,230 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:16,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:16,345 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-31 17:34:16,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:16,545 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-31 17:34:16,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:16,610 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-31 17:34:16,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:16,637 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-31 17:34:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:16,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:16,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:16,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:16,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:16,657 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-31 17:34:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:16,886 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-31 17:34:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:16,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:34:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:16,888 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:34:16,888 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:34:16,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:34:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:34:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-31 17:34:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:34:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-31 17:34:16,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-31 17:34:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:16,894 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-31 17:34:16,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-31 17:34:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:16,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:16,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:16,895 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-31 17:34:16,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:16,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:16,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:16,920 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-31 17:34:16,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:16,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:16,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:16,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:16,922 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-31 17:34:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:16,950 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-31 17:34:16,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:16,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:34:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:16,951 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:34:16,951 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:34:16,952 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-31 17:34:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:34:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 17:34:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:34:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-31 17:34:16,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-31 17:34:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:16,957 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-31 17:34:16,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-31 17:34:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:16,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:16,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:16,958 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:16,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:16,958 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-31 17:34:16,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:16,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:16,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:17,022 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-31 17:34:17,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:17,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:17,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:17,023 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-31 17:34:17,026 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:17,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:17,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:17,309 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:17,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:17,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:17,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:34:17,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:17,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:17,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:17,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:17,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-31 17:34:17,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:17,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:17,467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:17,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:17,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:17,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:17,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:17,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:17,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:17,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:17,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:17,536 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:17,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:17,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:17,556 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:17,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:17,585 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-31 17:34:17,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:17,620 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-31 17:34:17,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:17,651 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-31 17:34:17,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:17,700 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-31 17:34:17,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:17,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:17,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:17,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:17,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:17,722 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-31 17:34:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:17,898 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-31 17:34:17,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:17,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:34:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:17,899 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:34:17,899 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:34:17,900 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-31 17:34:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:34:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-31 17:34:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:34:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-31 17:34:17,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-31 17:34:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:17,905 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-31 17:34:17,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-31 17:34:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:17,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:17,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:17,906 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-31 17:34:17,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:17,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:17,983 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-31 17:34:17,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:17,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:17,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:17,984 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-31 17:34:17,985 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:17,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:18,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:18,475 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:18,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:18,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:18,476 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-31 17:34:18,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:18,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:18,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:18,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:18,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:18,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:18,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:18,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:18,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:18,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:18,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:18,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-31 17:34:18,682 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:18,683 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:18,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:18,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:18,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:18,891 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:18,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:18,952 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-31 17:34:18,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:18,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:18,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:19,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:19,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:34:19,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:19,092 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-31 17:34:19,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-31 17:34:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:19,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:19,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-31 17:34:19,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:19,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:19,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:19,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:19,168 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-31 17:34:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:19,403 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-31 17:34:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:19,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:34:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:19,405 INFO L225 Difference]: With dead ends: 35 [2019-01-31 17:34:19,405 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 17:34:19,406 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-31 17:34:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 17:34:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-31 17:34:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 17:34:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-31 17:34:19,412 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-31 17:34:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:19,413 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-31 17:34:19,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-31 17:34:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:19,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:19,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:19,414 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:19,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:19,414 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-31 17:34:19,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:19,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:19,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:19,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:19,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:19,452 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-31 17:34:19,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:19,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:19,453 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:19,453 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-31 17:34:19,455 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:19,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:19,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:19,706 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:19,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:19,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:19,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:34:19,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:19,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:19,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:19,760 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 12 treesize of output 15 [2019-01-31 17:34:19,795 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 15 treesize of output 17 [2019-01-31 17:34:19,805 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-31 17:34:19,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:19,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:19,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:19,834 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-31 17:34:19,834 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-31 17:34:19,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:19,846 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-31 17:34:19,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:19,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:19,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:34:19,855 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-31 17:34:19,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:19,859 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-31 17:34:19,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:19,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-31 17:34:19,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:19,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:19,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:34:19,880 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-31 17:34:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:19,938 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-31 17:34:19,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:19,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:34:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:19,940 INFO L225 Difference]: With dead ends: 30 [2019-01-31 17:34:19,946 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 17:34:19,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:34:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 17:34:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-31 17:34:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:34:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-31 17:34:19,958 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-31 17:34:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:19,958 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-31 17:34:19,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-31 17:34:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:19,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:19,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:19,961 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-31 17:34:19,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:19,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:19,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:19,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:20,097 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-31 17:34:20,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:20,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:20,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:20,099 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-31 17:34:20,100 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:20,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:20,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:20,492 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:20,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:20,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:20,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:20,494 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-31 17:34:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:20,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:20,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:20,676 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-31 17:34:20,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:20,703 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 15 treesize of output 21 [2019-01-31 17:34:20,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:20,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:20,768 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:20,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:20,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:21,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:21,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:21,448 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-31 17:34:21,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:21,454 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:21,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:21,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:21,473 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:21,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,494 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-31 17:34:21,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:21,510 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-31 17:34:21,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:21,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:21,535 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-31 17:34:21,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:21,556 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-31 17:34:21,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-31 17:34:21,573 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-31 17:34:21,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:21,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:21,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:34:21,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:21,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:21,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:21,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:21,633 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-31 17:34:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:21,954 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-31 17:34:21,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:21,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:34:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:21,956 INFO L225 Difference]: With dead ends: 48 [2019-01-31 17:34:21,956 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:34:21,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:34:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-31 17:34:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:34:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-31 17:34:21,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-31 17:34:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:21,966 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-31 17:34:21,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-31 17:34:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:21,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:21,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:21,968 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-31 17:34:21,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:21,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:21,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:22,035 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-31 17:34:22,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:22,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:22,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:22,036 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-31 17:34:22,037 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:22,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:24,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:24,178 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:24,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:24,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:24,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 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-31 17:34:24,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:24,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:24,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:24,209 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 11 treesize of output 14 [2019-01-31 17:34:24,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-31 17:34:24,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:24,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-31 17:34:24,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-31 17:34:24,259 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:24,297 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-31 17:34:24,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,319 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-31 17:34:24,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,330 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-31 17:34:24,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-31 17:34:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:24,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:24,353 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-31 17:34:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:24,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:24,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:24,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:24,372 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-31 17:34:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:24,552 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-31 17:34:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:24,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:34:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:24,553 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:34:24,553 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:34:24,554 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-31 17:34:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:34:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-31 17:34:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:34:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-31 17:34:24,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-31 17:34:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:24,563 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-31 17:34:24,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-31 17:34:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:24,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:24,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:24,564 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:24,565 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-31 17:34:24,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:24,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:24,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:24,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:24,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:24,652 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-31 17:34:24,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:24,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:24,652 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:24,652 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-31 17:34:24,653 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:24,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:24,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:24,791 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:24,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:24,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:24,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 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-31 17:34:24,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:24,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:24,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:24,823 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 12 treesize of output 15 [2019-01-31 17:34:24,829 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 15 treesize of output 17 [2019-01-31 17:34:24,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,841 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 17 treesize of output 24 [2019-01-31 17:34:24,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,882 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 11 treesize of output 14 [2019-01-31 17:34:24,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-31 17:34:24,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:24,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:24,987 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-31 17:34:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,025 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-31 17:34:25,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,029 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-31 17:34:25,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-31 17:34:25,039 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-31 17:34:25,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:25,046 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-31 17:34:25,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:25,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-31 17:34:25,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:25,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:25,068 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-31 17:34:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:25,099 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-31 17:34:25,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:25,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:34:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:25,101 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:34:25,101 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:34:25,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:34:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-31 17:34:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:34:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-31 17:34:25,111 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-31 17:34:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:25,111 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-31 17:34:25,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-31 17:34:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:25,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:25,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:25,112 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-31 17:34:25,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:25,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:25,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:25,161 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-31 17:34:25,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:25,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:25,162 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:25,162 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-31 17:34:25,163 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:25,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:25,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:25,431 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:25,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:25,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:25,431 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-31 17:34:25,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:25,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:25,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:25,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:25,474 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 15 treesize of output 21 [2019-01-31 17:34:25,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:25,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:25,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,580 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:25,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,606 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-31 17:34:25,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,618 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-31 17:34:25,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:25,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,638 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:25,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:34:25,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,650 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-31 17:34:25,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 17:34:25,662 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-31 17:34:25,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:25,682 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-31 17:34:25,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:25,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:34:25,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:25,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:34:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:34:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:25,702 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-31 17:34:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:25,849 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-31 17:34:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:34:25,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-31 17:34:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:25,851 INFO L225 Difference]: With dead ends: 38 [2019-01-31 17:34:25,851 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:34:25,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:34:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-31 17:34:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:34:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-31 17:34:25,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-31 17:34:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:25,861 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-31 17:34:25,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:34:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-31 17:34:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:25,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:25,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:25,862 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-31 17:34:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:25,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:25,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:25,919 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-31 17:34:25,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:25,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:25,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:25,919 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-31 17:34:25,920 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:25,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:26,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:26,141 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:26,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:26,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:26,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 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-31 17:34:26,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:26,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:26,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:26,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-31 17:34:26,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:26,192 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 15 treesize of output 21 [2019-01-31 17:34:26,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-31 17:34:26,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:26,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-31 17:34:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:34:26,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:34:26,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,319 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-31 17:34:26,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,327 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-31 17:34:26,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-31 17:34:26,337 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-31 17:34:26,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:26,382 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-31 17:34:26,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:26,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:26,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:26,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:26,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:26,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:26,402 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-31 17:34:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:26,726 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-31 17:34:26,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:26,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:34:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:26,727 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:34:26,727 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:34:26,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:34:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-31 17:34:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:34:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-31 17:34:26,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-31 17:34:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:26,737 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-31 17:34:26,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-31 17:34:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:26,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:26,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:26,738 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:26,738 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-31 17:34:26,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:26,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:26,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:26,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:26,820 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-31 17:34:26,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:26,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:26,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:26,821 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-31 17:34:26,824 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:26,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:27,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:27,129 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:27,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:27,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:27,130 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-31 17:34:27,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:27,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:27,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:27,181 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 12 treesize of output 15 [2019-01-31 17:34:27,190 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 15 treesize of output 17 [2019-01-31 17:34:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,201 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 17 treesize of output 24 [2019-01-31 17:34:27,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,247 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 11 treesize of output 14 [2019-01-31 17:34:27,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-31 17:34:27,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:27,277 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-31 17:34:27,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,297 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-31 17:34:27,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:34:27,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:27,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:34:27,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:27,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:27,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-31 17:34:27,349 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-31 17:34:27,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:27,367 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-31 17:34:27,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:27,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:27,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:27,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:27,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:27,388 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-31 17:34:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:27,530 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-31 17:34:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:27,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:34:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:27,533 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:34:27,533 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:34:27,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:34:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-31 17:34:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 17:34:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-31 17:34:27,545 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-31 17:34:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:27,546 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-31 17:34:27,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-31 17:34:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:27,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:27,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:27,547 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-31 17:34:27,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:27,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:27,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:27,719 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-31 17:34:27,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:27,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:27,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:27,720 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-31 17:34:27,722 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:27,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:28,041 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:28,041 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:34:28,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:28,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:28,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:28,042 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-31 17:34:28,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:28,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:28,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:28,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:28,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:28,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:28,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-31 17:34:28,155 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:28,155 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,165 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,180 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:28,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,197 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-31 17:34:28,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,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-31 17:34:28,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:28,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,265 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:28,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, 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-31 17:34:28,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:28,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-31 17:34:28,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:34:28,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,340 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-31 17:34:28,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 17:34:28,354 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-31 17:34:28,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:28,403 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-31 17:34:28,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:28,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:34:28,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:28,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:28,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:28,425 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-31 17:34:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:28,624 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-31 17:34:28,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:34:28,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:34:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:28,626 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:34:28,626 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 17:34:28,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:34:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 17:34:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-31 17:34:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:34:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-31 17:34:28,636 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-31 17:34:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:28,636 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-31 17:34:28,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-31 17:34:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:28,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:28,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:34:28,637 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-31 17:34:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:28,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:28,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-31 17:34:28,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:28,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:28,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:34:28,933 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-31 17:34:28,934 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:28,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:29,152 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:29,152 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:29,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:29,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:29,152 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-31 17:34:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:29,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:29,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:29,169 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 12 treesize of output 15 [2019-01-31 17:34:29,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17 [2019-01-31 17:34:29,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,186 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 17 treesize of output 24 [2019-01-31 17:34:29,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,226 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 11 treesize of output 14 [2019-01-31 17:34:29,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-31 17:34:29,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,257 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,265 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-31 17:34:29,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:34:29,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:34:29,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:34:29,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-31 17:34:29,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-31 17:34:29,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,400 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:29,401 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-31 17:34:29,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 17:34:29,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-31 17:34:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:29,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:29,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:29,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-31 17:34:29,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:29,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:29,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:29,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:29,508 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-31 17:34:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:29,810 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-31 17:34:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:34:29,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:34:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:29,811 INFO L225 Difference]: With dead ends: 28 [2019-01-31 17:34:29,811 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:34:29,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:34:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:34:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-31 17:34:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 17:34:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-31 17:34:29,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-31 17:34:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:29,822 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-31 17:34:29,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-31 17:34:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:29,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:29,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:34:29,823 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-31 17:34:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:29,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:29,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:29,910 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-31 17:34:29,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:29,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:29,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:34:29,911 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-31 17:34:29,912 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:29,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:30,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:30,295 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:34:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:30,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:30,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:30,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:34:30,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:30,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:30,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:30,463 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-31 17:34:30,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 17:34:30,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-31 17:34:30,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-31 17:34:30,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-31 17:34:30,625 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-31 17:34:30,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,700 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 17:34:30,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,719 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-31 17:34:30,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,729 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-31 17:34:30,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:30,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:34:30,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,767 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-31 17:34:30,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-31 17:34:30,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:30,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:30,796 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-31 17:34:30,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:30,812 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-31 17:34:30,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-31 17:34:30,831 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-31 17:34:30,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:30,877 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-31 17:34:30,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:30,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:34:30,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:30,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:34:30,899 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-31 17:34:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:31,137 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-31 17:34:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:34:31,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:34:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:31,138 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:34:31,139 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:34:31,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:34:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:34:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:34:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:34:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:34:31,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-31 17:34:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:31,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:34:31,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:34:31,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:34:31,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:34:31,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:34:31,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:34:31,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:34:31,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:34:31,305 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-31 17:34:32,497 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-31 17:34:32,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:34:32,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:34:32,502 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-01-31 17:34:32,502 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-31 17:34:32,502 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-31 17:34:32,502 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-31 17:34:32,502 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-31 17:34:32,502 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-31 17:34:32,502 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-31 17:34:32,510 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:34:32 BoogieIcfgContainer [2019-01-31 17:34:32,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:34:32,511 INFO L168 Benchmark]: Toolchain (without parser) took 20358.61 ms. Allocated memory was 134.2 MB in the beginning and 607.6 MB in the end (delta: 473.4 MB). Free memory was 109.5 MB in the beginning and 380.8 MB in the end (delta: -271.4 MB). Peak memory consumption was 202.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:32,511 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:34:32,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:32,512 INFO L168 Benchmark]: Boogie Preprocessor took 28.45 ms. Allocated memory is still 134.2 MB. Free memory was 107.2 MB in the beginning and 105.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:32,512 INFO L168 Benchmark]: RCFGBuilder took 291.57 ms. Allocated memory is still 134.2 MB. Free memory was 105.9 MB in the beginning and 96.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:32,512 INFO L168 Benchmark]: TraceAbstraction took 19977.75 ms. Allocated memory was 134.2 MB in the beginning and 607.6 MB in the end (delta: 473.4 MB). Free memory was 95.8 MB in the beginning and 380.8 MB in the end (delta: -285.0 MB). Peak memory consumption was 188.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:34:32,514 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.20 ms. Allocated memory is still 134.2 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.45 ms. Allocated memory is still 134.2 MB. Free memory was 107.2 MB in the beginning and 105.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 291.57 ms. Allocated memory is still 134.2 MB. Free memory was 105.9 MB in the beginning and 96.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19977.75 ms. Allocated memory was 134.2 MB in the beginning and 607.6 MB in the end (delta: 473.4 MB). Free memory was 95.8 MB in the beginning and 380.8 MB in the end (delta: -285.0 MB). Peak memory consumption was 188.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 19.9s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.8s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...