java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:53:40,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:53:40,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:53:40,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:53:40,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:53:40,312 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:53:40,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:53:40,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:53:40,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:53:40,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:53:40,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:53:40,329 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:53:40,329 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:53:40,330 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:53:40,331 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:53:40,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:53:40,333 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:53:40,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:53:40,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:53:40,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:53:40,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:53:40,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:53:40,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:53:40,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:53:40,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:53:40,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:53:40,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:53:40,345 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:53:40,346 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:53:40,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:53:40,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:53:40,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:53:40,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:53:40,348 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:53:40,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:53:40,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:53:40,350 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:53:40,362 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:53:40,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:53:40,363 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:53:40,364 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:53:40,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:53:40,364 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:53:40,364 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:53:40,364 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:53:40,365 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:53:40,365 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:53:40,365 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:53:40,365 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:53:40,365 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:53:40,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:53:40,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:53:40,366 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:53:40,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:53:40,367 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:53:40,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:53:40,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:53:40,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:53:40,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:53:40,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:53:40,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:53:40,368 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:53:40,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:53:40,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:53:40,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:53:40,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:53:40,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:53:40,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:53:40,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:53:40,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:53:40,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:53:40,370 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:53:40,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:53:40,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:53:40,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:53:40,371 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:53:40,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:53:40,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:53:40,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:53:40,423 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:53:40,424 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:53:40,424 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-25 15:53:40,424 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-02-25 15:53:40,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:53:40,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:53:40,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:53:40,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:53:40,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:53:40,478 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,492 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:53:40,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:53:40,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:53:40,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:53:40,531 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,531 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,534 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,534 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,538 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,542 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,544 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 25.02 03:53:40" (1/1) ... [2019-02-25 15:53:40,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:53:40,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:53:40,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:53:40,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:53:40,548 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 25.02 03:53:40" (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-25 15:53:40,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:53:40,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:53:41,166 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:53:41,166 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-02-25 15:53:41,168 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:53:41 BoogieIcfgContainer [2019-02-25 15:53:41,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:53:41,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:53:41,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:53:41,173 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:53:41,173 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 25.02 03:53:40" (1/2) ... [2019-02-25 15:53:41,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a35442 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:53:41, skipping insertion in model container [2019-02-25 15:53:41,174 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 25.02 03:53:41" (2/2) ... [2019-02-25 15:53:41,176 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-02-25 15:53:41,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:53:41,193 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-02-25 15:53:41,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-02-25 15:53:41,236 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:53:41,237 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:53:41,237 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:53:41,237 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:53:41,237 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:53:41,237 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:53:41,238 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:53:41,238 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:53:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-02-25 15:53:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:53:41,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:41,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:53:41,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-02-25 15:53:41,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:41,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:41,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:41,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:41,534 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-25 15:53:41,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:53:41,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:53:41,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:41,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:53:41,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:53:41,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:53:41,555 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-02-25 15:53:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:41,837 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-02-25 15:53:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:53:41,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:53:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:41,861 INFO L225 Difference]: With dead ends: 41 [2019-02-25 15:53:41,861 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:53:41,867 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-25 15:53:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:53:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-02-25 15:53:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:53:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-02-25 15:53:41,916 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-02-25 15:53:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:41,917 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-02-25 15:53:41,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:53:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-02-25 15:53:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:41,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:41,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:41,919 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-02-25 15:53:41,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:41,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:41,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:41,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:42,087 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-25 15:53:42,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:42,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:42,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:53:42,094 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-02-25 15:53:42,150 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:42,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:43,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:43,380 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:43,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:43,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:43,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:53:43,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:43,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:43,439 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:53:43,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:43,506 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-02-25 15:53:43,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,551 INFO L467 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-25 15:53:43,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,612 INFO L467 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-25 15:53:43,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,655 INFO L467 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-25 15:53:43,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,758 INFO L467 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-25 15:53:43,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,866 INFO L292 Elim1Store]: Index analysis took 103 ms [2019-02-25 15:53:43,868 INFO L467 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-25 15:53:43,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,042 INFO L292 Elim1Store]: Index analysis took 169 ms [2019-02-25 15:53:44,044 INFO L467 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-25 15:53:44,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,238 INFO L292 Elim1Store]: Index analysis took 188 ms [2019-02-25 15:53:44,239 INFO L467 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-25 15:53:44,438 INFO L292 Elim1Store]: Index analysis took 193 ms [2019-02-25 15:53:44,441 INFO L467 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-25 15:53:44,443 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,125 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,540 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,630 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,680 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,720 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,757 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,831 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,856 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:53:46,092 INFO L301 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,176 INFO L301 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,206 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,258 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,307 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,368 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,457 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,587 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,753 INFO L301 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-25 15:53:46,754 INFO L208 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-25 15:53:46,973 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-02-25 15:53:47,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,019 INFO L467 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-25 15:53:47,020 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,188 INFO L301 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-25 15:53:47,189 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-25 15:53:47,211 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-25 15:53:47,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:47,227 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-25 15:53:47,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:47,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:47,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:47,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:47,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:47,249 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-02-25 15:53:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:59,447 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-02-25 15:53:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:59,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:53:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:59,450 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:53:59,450 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:53:59,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:53:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:53:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-02-25 15:53:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:53:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-02-25 15:53:59,459 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-02-25 15:53:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:59,459 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-02-25 15:53:59,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-02-25 15:53:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:53:59,460 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:59,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:53:59,461 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:59,461 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-02-25 15:53:59,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:59,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:59,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:59,580 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-25 15:53:59,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:59,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:53:59,581 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-02-25 15:53:59,583 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:59,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:59,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:59,999 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:00,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:00,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:00,000 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-25 15:54:00,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:00,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:00,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:54:00,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:00,162 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:54:00,164 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,255 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,268 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,282 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,344 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,396 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,461 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,531 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,609 INFO L467 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-25 15:54:00,614 INFO L467 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-25 15:54:00,619 INFO L467 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-25 15:54:00,623 INFO L467 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-25 15:54:00,647 INFO L467 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-25 15:54:00,666 INFO L467 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-25 15:54:00,681 INFO L467 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-25 15:54:00,698 INFO L467 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-25 15:54:00,740 INFO L467 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-25 15:54:00,741 INFO L301 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,872 INFO L301 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,934 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,982 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,020 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,051 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,076 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,098 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,117 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,225 INFO L301 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-25 15:54:01,226 INFO L208 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-25 15:54:01,480 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-02-25 15:54:01,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,542 INFO L467 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-25 15:54:01,543 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,691 INFO L301 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-25 15:54:01,691 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-25 15:54:01,731 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-25 15:54:01,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:01,758 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-25 15:54:01,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:01,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:54:01,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:01,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:54:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:54:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:54:01,780 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-02-25 15:54:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:13,165 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-02-25 15:54:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:54:13,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:54:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:13,168 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:54:13,168 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:54:13,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:54:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:54:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-02-25 15:54:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:54:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2019-02-25 15:54:13,176 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 69 transitions. Word has length 3 [2019-02-25 15:54:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:13,177 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 69 transitions. [2019-02-25 15:54:13,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:54:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 69 transitions. [2019-02-25 15:54:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:54:13,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:13,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:54:13,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:13,179 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2019-02-25 15:54:13,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:13,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:13,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:13,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:13,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:13,356 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-25 15:54:13,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:13,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:13,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:54:13,364 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2019-02-25 15:54:13,365 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:13,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:16,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:16,326 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:54:16,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:16,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:16,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:16,327 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-25 15:54:16,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:16,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:16,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:54:16,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:16,382 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-02-25 15:54:16,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,421 INFO L467 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-25 15:54:16,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,475 INFO L467 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-25 15:54:16,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,526 INFO L467 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-25 15:54:16,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,541 INFO L467 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-25 15:54:16,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,555 INFO L467 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-25 15:54:16,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,620 INFO L467 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-25 15:54:16,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,656 INFO L467 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-25 15:54:16,698 INFO L467 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-25 15:54:16,699 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,784 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,854 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,921 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,971 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,007 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,042 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,068 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,091 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,238 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-25 15:54:17,238 INFO L301 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,277 INFO L301 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,290 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,313 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,348 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,406 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,478 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,555 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,707 INFO L301 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-25 15:54:17,708 INFO L208 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-25 15:54:17,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,884 INFO L467 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-25 15:54:17,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-02-25 15:54:18,025 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 256 xjuncts. [2019-02-25 15:54:22,543 INFO L301 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-25 15:54:22,544 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:168, output treesize:1311 [2019-02-25 15:54:35,226 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:54:35,427 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:35,428 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:581) 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:292) 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-25 15:54:35,434 INFO L168 Benchmark]: Toolchain (without parser) took 54973.90 ms. Allocated memory was 138.9 MB in the beginning and 536.9 MB in the end (delta: 397.9 MB). Free memory was 106.5 MB in the beginning and 97.8 MB in the end (delta: 8.7 MB). Peak memory consumption was 406.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:54:35,435 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 138.9 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:54:35,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.55 ms. Allocated memory is still 138.9 MB. Free memory was 106.1 MB in the beginning and 104.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:54:35,437 INFO L168 Benchmark]: Boogie Preprocessor took 26.49 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:54:35,437 INFO L168 Benchmark]: RCFGBuilder took 621.82 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 88.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:54:35,438 INFO L168 Benchmark]: TraceAbstraction took 54264.20 ms. Allocated memory was 138.9 MB in the beginning and 536.9 MB in the end (delta: 397.9 MB). Free memory was 88.5 MB in the beginning and 97.8 MB in the end (delta: -9.3 MB). Peak memory consumption was 388.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:54:35,442 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.15 ms. Allocated memory is still 138.9 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.55 ms. Allocated memory is still 138.9 MB. Free memory was 106.1 MB in the beginning and 104.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.49 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 621.82 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 88.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54264.20 ms. Allocated memory was 138.9 MB in the beginning and 536.9 MB in the end (delta: 397.9 MB). Free memory was 88.5 MB in the beginning and 97.8 MB in the end (delta: -9.3 MB). Peak memory consumption was 388.6 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...