java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:07:24,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:07:24,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:07:24,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:07:24,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:07:24,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:07:24,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:07:24,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:07:24,202 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:07:24,203 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:07:24,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:07:24,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:07:24,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:07:24,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:07:24,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:07:24,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:07:24,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:07:24,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:07:24,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:07:24,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:07:24,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:07:24,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:07:24,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:07:24,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:07:24,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:07:24,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:07:24,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:07:24,247 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:07:24,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:07:24,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:07:24,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:07:24,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:07:24,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:07:24,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:07:24,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:07:24,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:07:24,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 17:07:24,280 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:07:24,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:07:24,281 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:07:24,282 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:07:24,282 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:07:24,282 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:07:24,282 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:07:24,282 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:07:24,285 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:07:24,285 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:07:24,286 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:07:24,286 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:07:24,286 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:07:24,286 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:07:24,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:07:24,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:07:24,288 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:07:24,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:07:24,288 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:07:24,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:07:24,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:07:24,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:07:24,289 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:07:24,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:07:24,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:07:24,291 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:07:24,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:07:24,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:07:24,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:07:24,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:07:24,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:07:24,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:07:24,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:07:24,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:07:24,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:07:24,294 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:07:24,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:07:24,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:07:24,295 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:07:24,295 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:07:24,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:07:24,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:07:24,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:07:24,364 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:07:24,365 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:07:24,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl [2019-01-31 17:07:24,366 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl' [2019-01-31 17:07:24,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:07:24,430 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:07:24,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:07:24,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:07:24,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:07:24,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:07:24,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:07:24,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:07:24,492 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:07:24,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... [2019-01-31 17:07:24,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:07:24,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:07:24,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:07:24,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:07:24,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:07:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:07:24,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:07:24,987 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:07:24,987 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-31 17:07:24,989 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:07:24 BoogieIcfgContainer [2019-01-31 17:07:24,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:07:24,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:07:24,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:07:25,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:07:25,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:07:24" (1/2) ... [2019-01-31 17:07:25,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44df79ad and model type speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:07:25, skipping insertion in model container [2019-01-31 17:07:25,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:07:24" (2/2) ... [2019-01-31 17:07:25,003 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-limited.bpl [2019-01-31 17:07:25,013 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:07:25,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-31 17:07:25,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-31 17:07:25,069 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:07:25,069 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:07:25,070 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:07:25,070 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:07:25,070 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:07:25,070 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:07:25,070 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:07:25,071 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:07:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-31 17:07:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:07:25,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:25,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:07:25,094 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:25,101 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-31 17:07:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:25,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:25,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:25,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:25,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:25,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:25,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:07:25,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:25,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:07:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:07:25,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:07:25,310 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-01-31 17:07:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:25,548 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-01-31 17:07:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:25,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:07:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:25,567 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:07:25,567 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 17:07:25,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:07:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 17:07:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-01-31 17:07:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:07:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-01-31 17:07:25,611 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-01-31 17:07:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:25,612 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-01-31 17:07:25,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:07:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-01-31 17:07:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:25,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:25,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:25,619 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-01-31 17:07:25,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:25,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:25,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:25,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:25,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:25,982 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-31 17:07:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:26,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:26,036 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:26,038 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-01-31 17:07:26,076 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:26,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:26,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:26,152 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:26,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:26,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:26,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:26,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:26,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:26,577 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-31 17:07:26,601 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 27 treesize of output 30 [2019-01-31 17:07:26,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,650 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 30 treesize of output 36 [2019-01-31 17:07:26,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-31 17:07:26,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-31 17:07:26,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:07:26,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-31 17:07:26,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,883 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-31 17:07:26,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-31 17:07:26,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-31 17:07:26,936 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,376 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,681 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:27,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,966 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 43 treesize of output 52 [2019-01-31 17:07:27,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-31 17:07:28,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:28,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2019-01-31 17:07:28,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:07:28,288 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-31 17:07:28,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:07:28,347 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,352 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,354 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,358 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,360 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,363 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:28,422 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-01-31 17:07:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,630 INFO L303 Elim1Store]: Index analysis took 161 ms [2019-01-31 17:07:28,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-31 17:07:28,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:28,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-31 17:07:39,534 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-31 17:07:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:39,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:39,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:39,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:39,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:39,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-31 17:07:39,575 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-01-31 17:10:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:25,928 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2019-01-31 17:10:25,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:10:25,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:10:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:25,931 INFO L225 Difference]: With dead ends: 63 [2019-01-31 17:10:25,932 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 17:10:25,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=31, Invalid=40, Unknown=1, NotChecked=0, Total=72 [2019-01-31 17:10:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 17:10:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2019-01-31 17:10:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:10:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2019-01-31 17:10:25,940 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 3 [2019-01-31 17:10:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:25,940 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. [2019-01-31 17:10:25,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:10:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. [2019-01-31 17:10:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:10:25,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:25,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:10:25,941 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash 30384, now seen corresponding path program 1 times [2019-01-31 17:10:25,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:25,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:25,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:25,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:26,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:26,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:26,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:10:26,009 INFO L207 CegarAbsIntRunner]: [0], [18], [35] [2019-01-31 17:10:26,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:26,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:26,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:26,025 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:10:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:26,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:26,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:26,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:26,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:26,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:26,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:26,163 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 27 treesize of output 30 [2019-01-31 17:10:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,204 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 30 treesize of output 36 [2019-01-31 17:10:26,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-31 17:10:26,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-31 17:10:26,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:10:26,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-31 17:10:26,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-31 17:10:26,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-31 17:10:26,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,671 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,716 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,755 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:26,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:26,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2019-01-31 17:10:27,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-31 17:10:27,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:10:27,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2019-01-31 17:10:27,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:10:27,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:10:27,308 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:27,312 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:27,329 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:27,332 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:27,345 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:27,348 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:27,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:27,390 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-01-31 17:10:27,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:27,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-01-31 17:10:27,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:27,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:27,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-31 17:10:38,279 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-31 17:10:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:38,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:38,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:38,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:10:38,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:38,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:10:38,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:10:38,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-31 17:10:38,310 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 6 states. [2019-01-31 17:13:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:23,362 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2019-01-31 17:13:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:13:23,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:13:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:23,365 INFO L225 Difference]: With dead ends: 62 [2019-01-31 17:13:23,365 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 17:13:23,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=31, Invalid=40, Unknown=1, NotChecked=0, Total=72 [2019-01-31 17:13:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 17:13:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 26. [2019-01-31 17:13:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:13:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2019-01-31 17:13:23,373 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 3 [2019-01-31 17:13:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:23,373 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. [2019-01-31 17:13:23,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:13:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. [2019-01-31 17:13:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:13:23,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:23,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:13:23,374 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:23,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:23,375 INFO L82 PathProgramCache]: Analyzing trace with hash 30944, now seen corresponding path program 1 times [2019-01-31 17:13:23,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:23,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:23,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:23,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:13:23,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:13:23,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:13:23,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:13:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:13:23,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:13:23,441 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 3 states. [2019-01-31 17:13:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:23,496 INFO L93 Difference]: Finished difference Result 31 states and 61 transitions. [2019-01-31 17:13:23,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:13:23,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:13:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:23,497 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:13:23,498 INFO L226 Difference]: Without dead ends: 30 [2019-01-31 17:13:23,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:13:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-31 17:13:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-31 17:13:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:13:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2019-01-31 17:13:23,504 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 60 transitions. Word has length 3 [2019-01-31 17:13:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:23,505 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 60 transitions. [2019-01-31 17:13:23,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:13:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 60 transitions. [2019-01-31 17:13:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:13:23,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:23,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:13:23,506 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash 30012, now seen corresponding path program 1 times [2019-01-31 17:13:23,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:23,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:23,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:23,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:23,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:23,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:23,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:13:23,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:13:23,555 INFO L207 CegarAbsIntRunner]: [0], [6], [35] [2019-01-31 17:13:23,556 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:13:23,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:13:23,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:13:23,566 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:13:23,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:23,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:13:23,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:23,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:13:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:23,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:13:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:23,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:13:23,806 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-31 17:13:23,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,813 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 29 treesize of output 41 [2019-01-31 17:13:23,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-01-31 17:13:23,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-31 17:13:23,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-31 17:13:23,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 74 [2019-01-31 17:13:23,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:13:23,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:23,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:23,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:23,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:23,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:23,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:23,948 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 27 treesize of output 30 [2019-01-31 17:13:23,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,952 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 30 treesize of output 36 [2019-01-31 17:13:23,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-31 17:13:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-31 17:13:23,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:13:23,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-31 17:13:23,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:23,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-31 17:13:24,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-31 17:13:24,025 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,113 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,161 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,199 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,227 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,253 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,271 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,286 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:24,325 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:80, output treesize:62 [2019-01-31 17:13:24,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-31 17:13:24,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:24,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:24,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-31 17:13:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:24,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:24,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:13:24,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:13:24,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:13:24,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:13:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:13:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:13:24,602 INFO L87 Difference]: Start difference. First operand 26 states and 60 transitions. Second operand 4 states. [2019-01-31 17:13:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:13:24,690 INFO L93 Difference]: Finished difference Result 32 states and 98 transitions. [2019-01-31 17:13:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:13:24,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:13:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:13:24,692 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:13:24,693 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:13:24,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:13:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:13:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-31 17:13:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:13:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-31 17:13:24,701 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 3 [2019-01-31 17:13:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:13:24,701 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-31 17:13:24,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:13:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-31 17:13:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:13:24,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:13:24,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:13:24,702 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:13:24,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash 30136, now seen corresponding path program 1 times [2019-01-31 17:13:24,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:13:24,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:24,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:24,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:13:24,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:13:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:24,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:24,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:13:24,758 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:13:24,758 INFO L207 CegarAbsIntRunner]: [0], [10], [35] [2019-01-31 17:13:24,760 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:13:24,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:13:24,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:13:24,777 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:13:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:13:24,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:13:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:13:24,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:13:24,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:13:24,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:13:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:13:24,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:13:24,957 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-31 17:13:24,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 27 treesize of output 30 [2019-01-31 17:13:24,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,966 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 30 treesize of output 36 [2019-01-31 17:13:24,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-31 17:13:24,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-31 17:13:24,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:24,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:13:25,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-31 17:13:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-31 17:13:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-31 17:13:25,126 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,230 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,293 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2019-01-31 17:13:25,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-31 17:13:25,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:13:25,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2019-01-31 17:13:25,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:13:25,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:13:25,713 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,716 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,718 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,720 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,722 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,726 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:13:25,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:25,775 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-01-31 17:13:25,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:13:25,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-31 17:13:25,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:13:26,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:13:26,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-31 17:13:36,657 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-31 17:13:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:36,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:36,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:13:36,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:13:36,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:13:36,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:13:36,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:13:36,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-31 17:13:36,704 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 6 states. [2019-01-31 17:14:33,101 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-01-31 17:14:33,105 INFO L168 Benchmark]: Toolchain (without parser) took 428676.18 ms. Allocated memory was 132.6 MB in the beginning and 338.7 MB in the end (delta: 206.0 MB). Free memory was 107.7 MB in the beginning and 258.0 MB in the end (delta: -150.3 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2019-01-31 17:14:33,106 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:14:33,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.87 ms. Allocated memory is still 132.6 MB. Free memory was 107.7 MB in the beginning and 105.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:14:33,107 INFO L168 Benchmark]: Boogie Preprocessor took 26.41 ms. Allocated memory is still 132.6 MB. Free memory was 105.2 MB in the beginning and 103.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:14:33,107 INFO L168 Benchmark]: RCFGBuilder took 470.38 ms. Allocated memory is still 132.6 MB. Free memory was 103.9 MB in the beginning and 90.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:14:33,108 INFO L168 Benchmark]: TraceAbstraction took 428114.28 ms. Allocated memory was 132.6 MB in the beginning and 338.7 MB in the end (delta: 206.0 MB). Free memory was 90.4 MB in the beginning and 258.0 MB in the end (delta: -167.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:14:33,111 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.87 ms. Allocated memory is still 132.6 MB. Free memory was 107.7 MB in the beginning and 105.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.41 ms. Allocated memory is still 132.6 MB. Free memory was 105.2 MB in the beginning and 103.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 470.38 ms. Allocated memory is still 132.6 MB. Free memory was 103.9 MB in the beginning and 90.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 428114.28 ms. Allocated memory was 132.6 MB in the beginning and 338.7 MB in the end (delta: 206.0 MB). Free memory was 90.4 MB in the beginning and 258.0 MB in the end (delta: -167.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...