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-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:58:00,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:58:00,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:58:00,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:58:00,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:58:00,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:58:00,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:58:00,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:58:00,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:58:00,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:58:00,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:58:00,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:58:00,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:58:00,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:58:00,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:58:00,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:58:00,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:58:00,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:58:00,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:58:00,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:58:00,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:58:00,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:58:00,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:58:00,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:58:00,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:58:00,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:58:00,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:58:00,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:58:00,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:58:00,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:58:00,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:58:00,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:58:00,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:58:00,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:58:00,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:58:00,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:58:00,192 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-02-15 10:58:00,205 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:58:00,206 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:58:00,206 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:58:00,207 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:58:00,207 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:58:00,207 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:58:00,207 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:58:00,207 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:58:00,208 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:58:00,208 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:58:00,208 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:58:00,208 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:58:00,208 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:58:00,209 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:58:00,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:58:00,209 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:58:00,210 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:58:00,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:58:00,210 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:58:00,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:58:00,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:58:00,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:58:00,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:58:00,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:58:00,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:58:00,211 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:58:00,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:58:00,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:58:00,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:58:00,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:58:00,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:58:00,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:58:00,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:58:00,213 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:58:00,213 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:58:00,213 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:58:00,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:58:00,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:58:00,214 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:58:00,214 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:58:00,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:58:00,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:58:00,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:58:00,273 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:58:00,274 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:58:00,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl [2019-02-15 10:58:00,275 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-02-15 10:58:00,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:58:00,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:58:00,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:58:00,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:58:00,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:58:00,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:58:00,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:58:00,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:58:00,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:58:00,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... [2019-02-15 10:58:00,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:58:00,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:58:00,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:58:00,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:58:00,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:58:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:58:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:58:00,941 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:58:00,941 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-02-15 10:58:00,943 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:58:00 BoogieIcfgContainer [2019-02-15 10:58:00,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:58:00,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:58:00,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:58:00,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:58:00,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:58:00" (1/2) ... [2019-02-15 10:58:00,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5d74ce and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:58:00, skipping insertion in model container [2019-02-15 10:58:00,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:58:00" (2/2) ... [2019-02-15 10:58:00,951 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-02-15 10:58:00,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:58:00,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-02-15 10:58:00,986 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-02-15 10:58:01,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:58:01,021 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:58:01,022 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:58:01,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:58:01,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:58:01,022 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:58:01,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:58:01,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:58:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-02-15 10:58:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:58:01,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:01,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:58:01,048 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-02-15 10:58:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:01,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:01,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:01,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:01,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:58:01,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:58:01,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:58:01,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:58:01,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:58:01,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:58:01,307 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-02-15 10:58:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:01,621 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-02-15 10:58:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:58:01,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:58:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:01,640 INFO L225 Difference]: With dead ends: 41 [2019-02-15 10:58:01,641 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 10:58:01,644 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-02-15 10:58:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 10:58:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-02-15 10:58:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 10:58:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-02-15 10:58:01,705 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-02-15 10:58:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:01,706 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-02-15 10:58:01,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:58:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-02-15 10:58:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:58:01,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:01,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:58:01,708 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-02-15 10:58:01,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:01,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:01,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:01,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:01,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:01,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:58:01,882 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-02-15 10:58:01,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:01,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:01,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:01,994 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:02,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:02,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:02,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-15 10:58:02,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:02,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:02,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:02,319 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-02-15 10:58:02,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-02-15 10:58:02,367 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 33 treesize of output 39 [2019-02-15 10:58:02,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,411 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 35 treesize of output 49 [2019-02-15 10:58:02,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,503 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 37 treesize of output 63 [2019-02-15 10:58:02,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,617 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-02-15 10:58:02,620 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 39 treesize of output 81 [2019-02-15 10:58:02,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,742 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-02-15 10:58:02,744 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 41 treesize of output 103 [2019-02-15 10:58:02,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,785 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 43 treesize of output 129 [2019-02-15 10:58:02,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,847 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-02-15 10:58:02,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-02-15 10:58:02,947 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,367 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,692 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,778 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,845 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:04,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:04,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,164 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 117 treesize of output 114 [2019-02-15 10:58:04,307 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-02-15 10:58:04,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-02-15 10:58:04,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,427 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 83 treesize of output 103 [2019-02-15 10:58:04,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-02-15 10:58:04,648 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-02-15 10:58:04,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-02-15 10:58:04,837 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-02-15 10:58:04,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-02-15 10:58:05,161 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-02-15 10:58:05,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 113 [2019-02-15 10:58:05,213 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,300 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,359 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,417 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,523 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,593 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,656 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,769 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-02-15 10:58:05,769 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-15 10:58:05,949 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-02-15 10:58:06,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:06,067 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-02-15 10:58:06,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:06,281 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-02-15 10:58:06,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-15 10:58:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:06,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:06,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:06,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:58:06,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:06,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:58:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:58:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:06,348 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-02-15 10:58:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:18,171 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-02-15 10:58:18,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:18,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:58:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:18,175 INFO L225 Difference]: With dead ends: 71 [2019-02-15 10:58:18,176 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 10:58:18,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:58:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 10:58:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-02-15 10:58:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 10:58:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-02-15 10:58:18,184 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-02-15 10:58:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:18,184 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-02-15 10:58:18,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-02-15 10:58:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:58:18,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:18,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:58:18,186 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:18,186 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-02-15 10:58:18,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:18,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:18,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:18,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:18,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:18,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:18,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:18,290 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:58:18,291 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-02-15 10:58:18,292 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:18,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:18,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:18,304 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:18,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:18,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:18,305 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-02-15 10:58:18,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:18,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:18,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:18,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,361 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 117 treesize of output 114 [2019-02-15 10:58:18,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-02-15 10:58:18,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,596 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 83 treesize of output 103 [2019-02-15 10:58:18,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-02-15 10:58:18,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-02-15 10:58:18,999 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-02-15 10:58:19,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-02-15 10:58:19,148 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-02-15 10:58:19,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:19,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 113 [2019-02-15 10:58:19,173 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,233 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-02-15 10:58:19,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-02-15 10:58:19,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-15 10:58:19,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-02-15 10:58:19,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-02-15 10:58:19,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 10:58:19,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-02-15 10:58:19,778 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-02-15 10:58:19,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-02-15 10:58:19,820 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,910 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:19,981 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,036 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,079 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,113 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,141 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,165 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,192 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,313 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-02-15 10:58:20,314 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-15 10:58:20,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,373 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-02-15 10:58:20,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,606 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-02-15 10:58:20,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-15 10:58:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:20,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:20,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:20,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:58:20,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:20,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:58:20,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:58:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:20,667 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-02-15 10:58:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:31,618 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-02-15 10:58:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:58:31,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:58:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:31,620 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:58:31,620 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 10:58:31,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 10:58:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-02-15 10:58:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:58:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2019-02-15 10:58:31,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 69 transitions. Word has length 3 [2019-02-15 10:58:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:31,628 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 69 transitions. [2019-02-15 10:58:31,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 69 transitions. [2019-02-15 10:58:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:58:31,629 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:31,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:58:31,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2019-02-15 10:58:31,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:31,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:31,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:31,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:31,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:31,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:31,755 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:58:31,755 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2019-02-15 10:58:31,756 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:31,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:31,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:31,766 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:31,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:31,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:31,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-15 10:58:31,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:31,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:31,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:31,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-02-15 10:58:31,860 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 33 treesize of output 39 [2019-02-15 10:58:31,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,869 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 35 treesize of output 49 [2019-02-15 10:58:31,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,948 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 37 treesize of output 63 [2019-02-15 10:58:31,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,965 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 39 treesize of output 81 [2019-02-15 10:58:31,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,981 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 41 treesize of output 103 [2019-02-15 10:58:32,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,137 INFO L303 Elim1Store]: Index analysis took 152 ms [2019-02-15 10:58:32,139 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 43 treesize of output 129 [2019-02-15 10:58:32,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,291 INFO L303 Elim1Store]: Index analysis took 149 ms [2019-02-15 10:58:32,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-02-15 10:58:32,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-02-15 10:58:32,376 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,482 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,545 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,598 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,637 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 114 [2019-02-15 10:58:32,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-02-15 10:58:32,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,983 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 83 treesize of output 103 [2019-02-15 10:58:33,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-02-15 10:58:33,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-02-15 10:58:33,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-02-15 10:58:33,485 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-02-15 10:58:33,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 113 [2019-02-15 10:58:33,508 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,573 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,635 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,695 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,754 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,816 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,915 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,018 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-02-15 10:58:34,019 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-15 10:58:35,764 WARN L181 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 88 [2019-02-15 10:58:35,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 16 case distinctions, treesize of input 56 treesize of output 190 [2019-02-15 10:58:35,921 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-02-15 10:58:36,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 256 xjuncts. [2019-02-15 10:58:40,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 64 dim-0 vars, and 9 xjuncts. [2019-02-15 10:58:40,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:168, output treesize:1167 [2019-02-15 10:58:55,819 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 10:58:56,020 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:56,022 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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 46 more [2019-02-15 10:58:56,027 INFO L168 Benchmark]: Toolchain (without parser) took 55712.43 ms. Allocated memory was 132.6 MB in the beginning and 466.1 MB in the end (delta: 333.4 MB). Free memory was 105.1 MB in the beginning and 224.6 MB in the end (delta: -119.6 MB). Peak memory consumption was 213.9 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:56,027 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 132.6 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:58:56,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.31 ms. Allocated memory is still 132.6 MB. Free memory was 105.1 MB in the beginning and 102.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:56,029 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 ms. Allocated memory is still 132.6 MB. Free memory was 102.5 MB in the beginning and 101.6 MB in the end (delta: 900.3 kB). Peak memory consumption was 900.3 kB. Max. memory is 7.1 GB. [2019-02-15 10:58:56,029 INFO L168 Benchmark]: RCFGBuilder took 516.73 ms. Allocated memory is still 132.6 MB. Free memory was 101.2 MB in the beginning and 87.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:56,030 INFO L168 Benchmark]: TraceAbstraction took 55081.92 ms. Allocated memory was 132.6 MB in the beginning and 466.1 MB in the end (delta: 333.4 MB). Free memory was 87.4 MB in the beginning and 224.6 MB in the end (delta: -137.2 MB). Peak memory consumption was 196.2 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:56,034 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.17 ms. Allocated memory is still 132.6 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.31 ms. Allocated memory is still 132.6 MB. Free memory was 105.1 MB in the beginning and 102.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.90 ms. Allocated memory is still 132.6 MB. Free memory was 102.5 MB in the beginning and 101.6 MB in the end (delta: 900.3 kB). Peak memory consumption was 900.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 516.73 ms. Allocated memory is still 132.6 MB. Free memory was 101.2 MB in the beginning and 87.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55081.92 ms. Allocated memory was 132.6 MB in the beginning and 466.1 MB in the end (delta: 333.4 MB). Free memory was 87.4 MB in the beginning and 224.6 MB in the end (delta: -137.2 MB). Peak memory consumption was 196.2 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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...