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-f57a05f [2019-01-07 22:10:17,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 22:10:17,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 22:10:17,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 22:10:17,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 22:10:17,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 22:10:17,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 22:10:17,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 22:10:17,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 22:10:17,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 22:10:17,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 22:10:17,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 22:10:17,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 22:10:17,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 22:10:17,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 22:10:17,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 22:10:17,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 22:10:17,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 22:10:17,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 22:10:17,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 22:10:17,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 22:10:17,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 22:10:17,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 22:10:17,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 22:10:17,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 22:10:17,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 22:10:17,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 22:10:17,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 22:10:17,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 22:10:17,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 22:10:17,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 22:10:17,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 22:10:17,144 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 22:10:17,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 22:10:17,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 22:10:17,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 22:10:17,146 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-07 22:10:17,166 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 22:10:17,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 22:10:17,170 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 22:10:17,171 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 22:10:17,171 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 22:10:17,171 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 22:10:17,171 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 22:10:17,171 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 22:10:17,172 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 22:10:17,172 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 22:10:17,173 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 22:10:17,173 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 22:10:17,173 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 22:10:17,174 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 22:10:17,175 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 22:10:17,175 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 22:10:17,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 22:10:17,175 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 22:10:17,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 22:10:17,177 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 22:10:17,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 22:10:17,178 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 22:10:17,178 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 22:10:17,178 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 22:10:17,179 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 22:10:17,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 22:10:17,179 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 22:10:17,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 22:10:17,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 22:10:17,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 22:10:17,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:10:17,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 22:10:17,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 22:10:17,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 22:10:17,181 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 22:10:17,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 22:10:17,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 22:10:17,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 22:10:17,182 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 22:10:17,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 22:10:17,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 22:10:17,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 22:10:17,235 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 22:10:17,236 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 22:10:17,237 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-07 22:10:17,237 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-07 22:10:17,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 22:10:17,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 22:10:17,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 22:10:17,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 22:10:17,276 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 22:10:17,294 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,306 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 22:10:17,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 22:10:17,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 22:10:17,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 22:10:17,342 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,342 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,344 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,344 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,349 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,361 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,363 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 07.01 10:10:17" (1/1) ... [2019-01-07 22:10:17,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 22:10:17,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 22:10:17,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 22:10:17,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 22:10:17,374 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 07.01 10:10:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:10:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 22:10:17,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 22:10:17,727 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 22:10:17,728 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-07 22:10:17,729 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 10:10:17 BoogieIcfgContainer [2019-01-07 22:10:17,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 22:10:17,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 22:10:17,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 22:10:17,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 22:10:17,733 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 07.01 10:10:17" (1/2) ... [2019-01-07 22:10:17,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364871a9 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 10:10:17, skipping insertion in model container [2019-01-07 22:10:17,734 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 07.01 10:10:17" (2/2) ... [2019-01-07 22:10:17,736 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-07 22:10:17,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 22:10:17,751 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-07 22:10:17,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-07 22:10:17,798 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 22:10:17,798 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 22:10:17,798 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 22:10:17,798 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 22:10:17,798 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 22:10:17,799 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 22:10:17,799 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 22:10:17,799 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 22:10:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-07 22:10:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 22:10:17,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:17,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 22:10:17,823 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-07 22:10:17,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:17,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:17,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:17,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:17,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:18,004 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-07 22:10:18,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:10:18,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 22:10:18,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:18,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:10:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:10:18,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:10:18,040 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-07 22:10:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:18,228 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-07 22:10:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:10:18,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 22:10:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:18,244 INFO L225 Difference]: With dead ends: 17 [2019-01-07 22:10:18,245 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 22:10:18,248 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-07 22:10:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 22:10:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-07 22:10:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 22:10:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-07 22:10:18,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-07 22:10:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:18,288 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-07 22:10:18,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:10:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-07 22:10:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:10:18,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:18,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:10:18,289 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-07 22:10:18,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:18,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:18,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:18,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:18,368 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-07 22:10:18,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:10:18,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 22:10:18,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:18,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:10:18,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:10:18,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:10:18,372 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-07 22:10:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:18,457 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 22:10:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:10:18,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 22:10:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:18,459 INFO L225 Difference]: With dead ends: 12 [2019-01-07 22:10:18,459 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 22:10:18,460 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-07 22:10:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 22:10:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-07 22:10:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 22:10:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-07 22:10:18,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-07 22:10:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:18,464 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-07 22:10:18,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:10:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-07 22:10:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:10:18,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:18,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:10:18,465 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-07 22:10:18,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:18,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:18,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:18,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:18,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:18,575 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-07 22:10:18,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:18,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:18,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:10:18,578 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-07 22:10:18,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:18,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:19,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:19,546 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-07 22:10:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:19,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:19,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:19,554 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-07 22:10:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:19,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:19,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:19,828 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-07 22:10:19,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:19,885 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-07 22:10:20,103 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-07 22:10:20,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:20,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:20,150 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-07 22:10:20,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:20,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:20,293 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-07 22:10:20,310 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-07 22:10:20,329 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-07 22:10:20,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:20,505 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:20,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:20,615 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-07 22:10:20,617 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:20,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:20,794 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-07 22:10:20,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:20,833 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-07 22:10:20,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:20,896 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-07 22:10:20,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:20,996 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-07 22:10:21,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 22:10:21,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-07 22:10:21,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:21,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:10:21,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:10:21,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 22:10:21,027 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-07 22:10:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:21,187 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-07 22:10:21,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:10:21,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 22:10:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:21,188 INFO L225 Difference]: With dead ends: 13 [2019-01-07 22:10:21,188 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 22:10:21,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 22:10:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 22:10:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-07 22:10:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 22:10:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-07 22:10:21,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-07 22:10:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:21,194 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-07 22:10:21,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:10:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-07 22:10:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:10:21,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:21,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:10:21,195 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-07 22:10:21,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:21,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:21,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:21,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:21,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:21,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:21,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:21,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:10:21,267 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-07 22:10:21,271 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:21,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:21,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:21,682 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-07 22:10:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:21,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:21,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:21,683 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-07 22:10:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:21,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:21,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:21,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:21,788 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-07 22:10:21,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:21,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:21,881 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-07 22:10:21,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:21,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:21,918 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-07 22:10:21,929 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-07 22:10:21,944 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-07 22:10:21,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:22,115 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:22,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:22,264 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-07 22:10:22,265 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:22,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:22,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-07 22:10:22,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:22,562 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-07 22:10:22,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:22,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:22,728 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-07 22:10:22,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:22,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 22:10:22,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:22,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 22:10:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 22:10:22,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 22:10:22,751 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-07 22:10:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:23,012 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-07 22:10:23,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 22:10:23,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 22:10:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:23,014 INFO L225 Difference]: With dead ends: 24 [2019-01-07 22:10:23,015 INFO L226 Difference]: Without dead ends: 23 [2019-01-07 22:10:23,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 22:10:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-07 22:10:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-07 22:10:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 22:10:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-07 22:10:23,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-07 22:10:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:23,022 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-07 22:10:23,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 22:10:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-07 22:10:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:10:23,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:23,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:10:23,023 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-07 22:10:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:23,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:23,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:23,084 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-07 22:10:23,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:10:23,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 22:10:23,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:23,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:10:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:10:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:10:23,086 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-07 22:10:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:23,143 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-07 22:10:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:10:23,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 22:10:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:23,144 INFO L225 Difference]: With dead ends: 15 [2019-01-07 22:10:23,144 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 22:10:23,145 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-07 22:10:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 22:10:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 22:10:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 22:10:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-07 22:10:23,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-07 22:10:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:23,150 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-07 22:10:23,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:10:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-07 22:10:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:10:23,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:23,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:10:23,151 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:23,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-07 22:10:23,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:23,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:23,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:23,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:23,232 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-07 22:10:23,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:23,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:23,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 22:10:23,233 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-07 22:10:23,234 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:23,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:23,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:23,582 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-07 22:10:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:23,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:23,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:23,583 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-07 22:10:23,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:23,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:23,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:23,642 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-07 22:10:23,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-07 22:10:23,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:23,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:23,660 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-07 22:10:23,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:23,713 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-07 22:10:23,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:23,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:23,745 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-07 22:10:23,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,768 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-07 22:10:23,769 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:23,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:23,825 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-07 22:10:23,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,898 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-07 22:10:23,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:23,922 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-07 22:10:23,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:23,956 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-07 22:10:23,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:23,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 22:10:23,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:23,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 22:10:23,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 22:10:23,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 22:10:23,978 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-07 22:10:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:24,215 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-07 22:10:24,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 22:10:24,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 22:10:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:24,217 INFO L225 Difference]: With dead ends: 21 [2019-01-07 22:10:24,217 INFO L226 Difference]: Without dead ends: 20 [2019-01-07 22:10:24,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-07 22:10:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-07 22:10:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-07 22:10:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-07 22:10:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-07 22:10:24,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-07 22:10:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:24,224 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-07 22:10:24,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 22:10:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-07 22:10:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:10:24,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:24,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:10:24,225 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-07 22:10:24,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:24,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:24,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:24,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:24,313 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-07 22:10:24,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:24,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:24,314 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 22:10:24,314 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-07 22:10:24,316 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:24,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:24,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:24,773 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-07 22:10:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:24,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:24,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:24,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 22:10:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:24,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:24,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:24,947 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-07 22:10:24,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:24,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-07 22:10:25,227 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-07 22:10:25,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,237 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-07 22:10:25,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:25,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:25,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-07 22:10:25,263 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-07 22:10:25,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-07 22:10:25,280 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:25,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:25,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:25,315 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-07 22:10:25,316 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:25,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 22:10:25,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:25,356 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-07 22:10:25,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:25,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:25,381 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-07 22:10:25,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:25,470 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-07 22:10:25,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-07 22:10:25,508 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-07 22:10:25,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:25,532 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-07 22:10:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:25,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 22:10:25,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:25,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 22:10:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 22:10:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 22:10:25,552 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-07 22:10:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:25,776 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-07 22:10:25,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 22:10:25,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 22:10:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:25,778 INFO L225 Difference]: With dead ends: 35 [2019-01-07 22:10:25,778 INFO L226 Difference]: Without dead ends: 34 [2019-01-07 22:10:25,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 22:10:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-07 22:10:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-07 22:10:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 22:10:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-07 22:10:25,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-07 22:10:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:25,785 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-07 22:10:25,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 22:10:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-07 22:10:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:10:25,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:25,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:10:25,787 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-07 22:10:25,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:25,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:25,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:25,816 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-07 22:10:25,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:25,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:25,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 22:10:25,817 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-07 22:10:25,820 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:25,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:26,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:26,048 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-07 22:10:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:26,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:26,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:26,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 22:10:26,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:26,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:26,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:26,099 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-07 22:10:26,138 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-07 22:10:26,213 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-07 22:10:26,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:26,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:26,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:26,313 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-07 22:10:26,313 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-07 22:10:26,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:26,323 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-07 22:10:26,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:26,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:26,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-07 22:10:26,336 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-07 22:10:26,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:26,347 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-07 22:10:26,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 22:10:26,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-07 22:10:26,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:26,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:10:26,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:10:26,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-07 22:10:26,369 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-07 22:10:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:26,421 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-07 22:10:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:10:26,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 22:10:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:26,424 INFO L225 Difference]: With dead ends: 30 [2019-01-07 22:10:26,424 INFO L226 Difference]: Without dead ends: 29 [2019-01-07 22:10:26,424 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-07 22:10:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-07 22:10:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-07 22:10:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 22:10:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-07 22:10:26,432 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-07 22:10:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:26,433 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-07 22:10:26,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:10:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-07 22:10:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:10:26,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:26,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:10:26,434 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-07 22:10:26,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:26,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:26,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:26,527 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-07 22:10:26,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:26,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:26,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 22:10:26,528 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-07 22:10:26,530 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:26,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:26,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:26,914 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-07 22:10:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:26,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:26,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:26,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 22:10:26,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:26,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:26,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:27,029 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-07 22:10:27,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-07 22:10:27,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,036 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-07 22:10:27,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,071 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-07 22:10:27,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,103 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-07 22:10:27,104 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,121 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:27,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,137 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-07 22:10:27,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,176 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-07 22:10:27,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:27,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:27,201 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-07 22:10:27,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:27,217 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-07 22:10:27,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-07 22:10:27,231 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-07 22:10:27,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:27,264 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-07 22:10:27,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:27,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 22:10:27,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:27,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 22:10:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 22:10:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-07 22:10:27,286 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-07 22:10:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:27,621 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-07 22:10:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 22:10:27,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 22:10:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:27,623 INFO L225 Difference]: With dead ends: 48 [2019-01-07 22:10:27,623 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 22:10:27,624 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-07 22:10:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 22:10:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-07 22:10:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 22:10:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-07 22:10:27,633 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-07 22:10:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:27,633 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-07 22:10:27,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 22:10:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-07 22:10:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:10:27,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:27,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:10:27,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-07 22:10:27,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:27,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:27,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:27,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:27,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:27,672 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-07 22:10:27,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:27,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:27,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 22:10:27,673 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-07 22:10:27,676 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:27,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:30,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:30,423 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-07 22:10:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:30,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:30,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:30,424 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-07 22:10:30,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:30,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:30,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:30,477 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-07 22:10:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:30,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:30,629 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-07 22:10:30,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:30,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:30,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-07 22:10:30,819 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-07 22:10:30,855 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-07 22:10:30,856 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:30,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:31,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:31,212 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-07 22:10:31,213 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-07 22:10:31,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:31,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-07 22:10:31,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:31,377 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-07 22:10:31,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-07 22:10:31,389 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-07 22:10:31,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:31,399 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-07 22:10:31,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:31,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 22:10:31,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:31,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 22:10:31,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 22:10:31,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 22:10:31,419 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-07 22:10:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:31,498 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-07 22:10:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 22:10:31,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 22:10:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:31,499 INFO L225 Difference]: With dead ends: 39 [2019-01-07 22:10:31,499 INFO L226 Difference]: Without dead ends: 38 [2019-01-07 22:10:31,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-07 22:10:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-07 22:10:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-07 22:10:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-07 22:10:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-07 22:10:31,508 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-07 22:10:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:31,508 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-07 22:10:31,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 22:10:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-07 22:10:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:10:31,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:31,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:10:31,509 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:31,509 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-07 22:10:31,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:31,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:31,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:31,601 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-07 22:10:31,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:31,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:31,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 22:10:31,602 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-07 22:10:31,604 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:31,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:31,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:31,761 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-07 22:10:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:31,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:31,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:31,762 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-07 22:10:31,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:31,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:31,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:31,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-07 22:10:31,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-07 22:10:31,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:31,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:31,907 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-07 22:10:31,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:31,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:31,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:31,960 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-07 22:10:31,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:31,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:31,973 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-07 22:10:31,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:31,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,000 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-07 22:10:32,001 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-07 22:10:32,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,035 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-07 22:10:32,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,084 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-07 22:10:32,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-07 22:10:32,107 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-07 22:10:32,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:32,215 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-07 22:10:32,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 22:10:32,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-07 22:10:32,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:32,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:10:32,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:10:32,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-07 22:10:32,245 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-07 22:10:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:32,288 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-07 22:10:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:10:32,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 22:10:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:32,289 INFO L225 Difference]: With dead ends: 39 [2019-01-07 22:10:32,289 INFO L226 Difference]: Without dead ends: 36 [2019-01-07 22:10:32,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-07 22:10:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-07 22:10:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-07 22:10:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 22:10:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-07 22:10:32,299 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-07 22:10:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:32,299 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-07 22:10:32,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:10:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-07 22:10:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:10:32,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:32,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:10:32,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:32,300 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-07 22:10:32,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:32,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:32,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:32,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:32,364 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-07 22:10:32,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:32,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:32,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 22:10:32,365 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-07 22:10:32,366 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:32,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:32,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:32,649 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-07 22:10:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:32,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:32,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:32,649 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-07 22:10:32,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:32,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:32,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:32,698 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-07 22:10:32,704 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-07 22:10:32,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,714 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-07 22:10:32,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-07 22:10:32,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,774 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-07 22:10:32,775 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,804 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:32,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-07 22:10:32,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,857 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-07 22:10:32,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:32,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:32,875 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 22:10:32,875 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-07 22:10:32,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,887 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-07 22:10:32,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-07 22:10:32,899 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-07 22:10:32,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:32,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-07 22:10:32,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:32,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 22:10:32,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:32,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 22:10:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 22:10:32,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-07 22:10:32,940 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-07 22:10:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:33,097 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-07 22:10:33,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 22:10:33,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-07 22:10:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:33,098 INFO L225 Difference]: With dead ends: 38 [2019-01-07 22:10:33,098 INFO L226 Difference]: Without dead ends: 35 [2019-01-07 22:10:33,098 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-07 22:10:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-07 22:10:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-07 22:10:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-07 22:10:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-07 22:10:33,106 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-07 22:10:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:33,107 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-07 22:10:33,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 22:10:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-07 22:10:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:10:33,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:33,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:10:33,108 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-07 22:10:33,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:33,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:33,177 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-07 22:10:33,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:33,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:33,177 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 22:10:33,178 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-07 22:10:33,180 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:33,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:33,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:33,439 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-07 22:10:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:33,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:33,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:33,440 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-07 22:10:33,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:33,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:33,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:33,479 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-07 22:10:33,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:33,494 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-07 22:10:33,496 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-07 22:10:33,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-07 22:10:33,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:33,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:33,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:33,538 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-07 22:10:33,539 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-07 22:10:33,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:33,565 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-07 22:10:33,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:33,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:33,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-07 22:10:33,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:33,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:33,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:33,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:33,610 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-07 22:10:33,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:33,619 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-07 22:10:33,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-07 22:10:33,629 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-07 22:10:33,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:33,682 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-07 22:10:33,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:33,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 22:10:33,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:33,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 22:10:33,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 22:10:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 22:10:33,703 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-07 22:10:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:34,016 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-07 22:10:34,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 22:10:34,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 22:10:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:34,017 INFO L225 Difference]: With dead ends: 45 [2019-01-07 22:10:34,018 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 22:10:34,018 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-07 22:10:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 22:10:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-07 22:10:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 22:10:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-07 22:10:34,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-07 22:10:34,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:34,028 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-07 22:10:34,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 22:10:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-07 22:10:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:10:34,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:34,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:10:34,030 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:34,030 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-07 22:10:34,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:34,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:34,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:34,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:34,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:34,099 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-07 22:10:34,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:34,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:34,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 22:10:34,100 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-07 22:10:34,102 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:34,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:34,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:34,395 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-07 22:10:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:34,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:34,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:34,396 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-07 22:10:34,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:34,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:34,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:34,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-07 22:10:34,459 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-07 22:10:34,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,468 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-07 22:10:34,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,499 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-07 22:10:34,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,547 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-07 22:10:34,547 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,593 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,602 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-07 22:10:34,603 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-07 22:10:34,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,631 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-07 22:10:34,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-07 22:10:34,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:34,653 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-07 22:10:34,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:34,662 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-07 22:10:34,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-07 22:10:34,674 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-07 22:10:34,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:34,694 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-07 22:10:34,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:34,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 22:10:34,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:34,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 22:10:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 22:10:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 22:10:34,715 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-07 22:10:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:34,886 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-07 22:10:34,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 22:10:34,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 22:10:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:34,888 INFO L225 Difference]: With dead ends: 52 [2019-01-07 22:10:34,888 INFO L226 Difference]: Without dead ends: 51 [2019-01-07 22:10:34,889 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-07 22:10:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-07 22:10:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-07 22:10:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-07 22:10:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-07 22:10:34,901 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-07 22:10:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:34,901 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-07 22:10:34,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 22:10:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-07 22:10:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:10:34,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:34,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:10:34,902 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-07 22:10:34,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:34,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:34,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:34,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:35,044 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-07 22:10:35,084 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-07 22:10:35,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:35,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:35,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 22:10:35,085 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-07 22:10:35,088 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:35,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:35,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:35,454 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-07 22:10:35,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:35,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:35,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:35,454 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-07 22:10:35,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:35,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:35,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:35,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,496 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-07 22:10:35,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,531 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-07 22:10:35,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,547 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-07 22:10:35,550 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-07 22:10:35,552 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-07 22:10:35,552 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,565 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,584 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:35,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,604 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-07 22:10:35,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,615 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-07 22:10:35,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:35,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 22:10:35,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-07 22:10:35,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,659 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-07 22:10:35,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-07 22:10:35,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:35,723 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-07 22:10:35,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:35,738 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-07 22:10:35,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-07 22:10:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:35,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:35,841 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-07 22:10:35,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:35,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 22:10:35,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:35,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 22:10:35,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 22:10:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-07 22:10:35,863 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-07 22:10:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:36,063 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-07 22:10:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 22:10:36,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 22:10:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:36,064 INFO L225 Difference]: With dead ends: 49 [2019-01-07 22:10:36,065 INFO L226 Difference]: Without dead ends: 48 [2019-01-07 22:10:36,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-07 22:10:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-07 22:10:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-07 22:10:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 22:10:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-07 22:10:36,076 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-07 22:10:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:36,076 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-07 22:10:36,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 22:10:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-07 22:10:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 22:10:36,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:36,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 22:10:36,077 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:36,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:36,077 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-07 22:10:36,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:36,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:36,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:36,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:36,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:36,281 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-07 22:10:36,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:36,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:36,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 22:10:36,282 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-07 22:10:36,284 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:36,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:36,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:36,505 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-07 22:10:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:36,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:36,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:36,506 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-07 22:10:36,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:36,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:36,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:36,527 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-07 22:10:36,531 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-07 22:10:36,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,543 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-07 22:10:36,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,575 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-07 22:10:36,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,592 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-07 22:10:36,592 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,607 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-07 22:10:36,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,637 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-07 22:10:36,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 22:10:36,665 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-07 22:10:36,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-07 22:10:36,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-07 22:10:36,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:36,734 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 22:10:36,735 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-07 22:10:36,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:36,752 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-07 22:10:36,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-07 22:10:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:36,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:36,861 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-07 22:10:36,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:36,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-07 22:10:36,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:36,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 22:10:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 22:10:36,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-07 22:10:36,881 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-07 22:10:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:37,276 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-07 22:10:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 22:10:37,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 22:10:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:37,277 INFO L225 Difference]: With dead ends: 28 [2019-01-07 22:10:37,277 INFO L226 Difference]: Without dead ends: 21 [2019-01-07 22:10:37,278 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-07 22:10:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-07 22:10:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-07 22:10:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 22:10:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-07 22:10:37,287 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-07 22:10:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:37,288 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-07 22:10:37,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 22:10:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-07 22:10:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 22:10:37,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:37,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 22:10:37,289 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-07 22:10:37,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:37,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:37,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:37,358 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-07 22:10:37,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:37,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:37,359 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 22:10:37,359 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-07 22:10:37,360 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:37,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:37,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:10:37,741 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-07 22:10:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:37,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:10:37,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:37,741 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-07 22:10:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:37,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:37,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:37,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:37,770 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-07 22:10:37,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:37,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:37,803 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-07 22:10:37,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:37,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:37,828 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-07 22:10:37,831 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-07 22:10:37,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-07 22:10:37,834 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:37,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:37,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:37,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:37,864 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-07 22:10:37,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:37,971 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-07 22:10:37,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:37,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 22:10:37,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-07 22:10:38,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,006 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-07 22:10:38,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:38,020 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-07 22:10:38,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-07 22:10:38,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,045 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 22:10:38,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:10:38,047 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-07 22:10:38,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:38,061 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-07 22:10:38,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-07 22:10:38,078 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-07 22:10:38,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:38,118 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-07 22:10:38,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:38,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 22:10:38,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:38,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 22:10:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 22:10:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-07 22:10:38,140 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-07 22:10:38,544 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-01-07 22:10:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:38,722 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-07 22:10:38,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 22:10:38,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 22:10:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:38,723 INFO L225 Difference]: With dead ends: 22 [2019-01-07 22:10:38,724 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 22:10:38,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-07 22:10:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 22:10:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 22:10:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 22:10:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 22:10:38,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-07 22:10:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:38,726 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 22:10:38,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 22:10:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 22:10:38,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 22:10:38,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 22:10:38,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 22:10:38,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 22:10:38,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 22:10:38,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 22:10:38,902 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-07 22:10:40,981 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-07 22:10:40,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-07 22:10:40,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-07 22:10:40,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-07 22:10:40,985 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-07 22:10:40,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-07 22:10:40,985 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-07 22:10:40,985 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-07 22:10:40,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-07 22:10:40,986 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-07 22:10:40,996 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 10:10:40 BoogieIcfgContainer [2019-01-07 22:10:40,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 22:10:40,997 INFO L168 Benchmark]: Toolchain (without parser) took 23723.00 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -980.4 MB). Peak memory consumption was 185.7 MB. Max. memory is 7.1 GB. [2019-01-07 22:10:40,998 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 22:10:40,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 22:10:40,998 INFO L168 Benchmark]: Boogie Preprocessor took 35.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 22:10:40,998 INFO L168 Benchmark]: RCFGBuilder took 363.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 22:10:40,999 INFO L168 Benchmark]: TraceAbstraction took 23266.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 164.5 MB. Max. memory is 7.1 GB. [2019-01-07 22:10:41,000 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 363.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23266.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 164.5 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, 23.2s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.7s 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, 7.5s 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, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.6s 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...