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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:40:46,836 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:40:46,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:40:46,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:40:46,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:40:46,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:40:46,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:40:46,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:40:46,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:40:46,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:40:46,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:40:46,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:40:46,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:40:46,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:40:46,861 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:40:46,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:40:46,863 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:40:46,865 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:40:46,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:40:46,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:40:46,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:40:46,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:40:46,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:40:46,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:40:46,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:40:46,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:40:46,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:40:46,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:40:46,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:40:46,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:40:46,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:40:46,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:40:46,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:40:46,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:40:46,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:40:46,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:40:46,885 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:40:46,908 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:40:46,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:40:46,909 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:40:46,910 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:40:46,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:40:46,910 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:40:46,910 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:40:46,910 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:40:46,911 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:40:46,911 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:40:46,911 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:40:46,911 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:40:46,911 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:40:46,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:40:46,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:40:46,912 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:40:46,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:40:46,913 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:40:46,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:40:46,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:40:46,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:40:46,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:40:46,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:40:46,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:40:46,914 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:40:46,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:40:46,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:40:46,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:40:46,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:40:46,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:40:46,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:40:46,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:40:46,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:40:46,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:40:46,918 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:40:46,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:40:46,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:40:46,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:40:46,919 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:40:46,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:40:46,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:40:46,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:40:46,973 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:40:46,974 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:40:46,975 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-03-04 16:40:46,975 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-03-04 16:40:47,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:40:47,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:40:47,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:40:47,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:40:47,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:40:47,029 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,046 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:40:47,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:40:47,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:40:47,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:40:47,098 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,098 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,102 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,102 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,110 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,121 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,122 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 04.03 04:40:47" (1/1) ... [2019-03-04 16:40:47,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:40:47,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:40:47,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:40:47,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:40:47,135 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 04.03 04:40:47" (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-03-04 16:40:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:40:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:40:47,703 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:40:47,703 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-03-04 16:40:47,705 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:40:47 BoogieIcfgContainer [2019-03-04 16:40:47,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:40:47,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:40:47,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:40:47,709 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:40:47,710 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 04.03 04:40:47" (1/2) ... [2019-03-04 16:40:47,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba1f835 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:40:47, skipping insertion in model container [2019-03-04 16:40:47,711 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 04.03 04:40:47" (2/2) ... [2019-03-04 16:40:47,713 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-03-04 16:40:47,723 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:40:47,731 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-03-04 16:40:47,747 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-03-04 16:40:47,780 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:40:47,780 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:40:47,780 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:40:47,780 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:40:47,780 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:40:47,781 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:40:47,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:40:47,781 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:40:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-03-04 16:40:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:40:47,803 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:47,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:40:47,807 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-03-04 16:40:47,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:47,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:47,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:48,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:40:48,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:40:48,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:48,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:40:48,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:40:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:40:48,059 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-03-04 16:40:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:48,298 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-03-04 16:40:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:40:48,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:40:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:48,314 INFO L225 Difference]: With dead ends: 41 [2019-03-04 16:40:48,315 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:40:48,318 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-03-04 16:40:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:40:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-03-04 16:40:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:40:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-03-04 16:40:48,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-03-04 16:40:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:48,358 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-03-04 16:40:48,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:40:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-03-04 16:40:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:48,375 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:48,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:48,380 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:48,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:48,381 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-03-04 16:40:48,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:48,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:48,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:48,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:48,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:48,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:48,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:48,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:48,660 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-03-04 16:40:48,712 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:48,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:48,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:48,783 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:48,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:48,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:48,788 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-03-04 16:40:48,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:48,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:48,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:40:48,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:48,961 INFO L453 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-03-04 16:40:49,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,018 INFO L453 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 35 [2019-03-04 16:40:49,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,067 INFO L453 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 37 [2019-03-04 16:40:49,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,102 INFO L453 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 39 [2019-03-04 16:40:49,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,281 INFO L301 Elim1Store]: Index analysis took 160 ms [2019-03-04 16:40:49,283 INFO L453 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 41 [2019-03-04 16:40:49,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,332 INFO L453 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 43 [2019-03-04 16:40:49,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,491 INFO L301 Elim1Store]: Index analysis took 126 ms [2019-03-04 16:40:49,494 INFO L453 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 45 [2019-03-04 16:40:49,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,669 INFO L301 Elim1Store]: Index analysis took 151 ms [2019-03-04 16:40:49,671 INFO L453 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 47 [2019-03-04 16:40:49,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:49,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,060 INFO L453 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 8 new quantified variables, introduced 16 case distinctions, treesize of input 47 treesize of output 70 [2019-03-04 16:40:50,063 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,203 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,249 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,328 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,385 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,411 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,437 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,464 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,493 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,655 INFO L453 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 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:40:50,658 INFO L309 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,676 INFO L309 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,705 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,766 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,844 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,929 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,044 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,156 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,275 INFO L309 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-03-04 16:40:51,276 INFO L209 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-03-04 16:40:51,576 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-03-04 16:40:51,609 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:40:51,610 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:51,736 INFO L309 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-03-04 16:40:51,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:127 [2019-03-04 16:40:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:51,784 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:51,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:51,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:51,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:51,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:51,826 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-03-04 16:41:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:03,723 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-03-04 16:41:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:41:03,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:41:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:03,730 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:41:03,730 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:41:03,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:41:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:41:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-03-04 16:41:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:41:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-03-04 16:41:03,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-03-04 16:41:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:03,739 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-03-04 16:41:03,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:41:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-03-04 16:41:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:41:03,739 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:03,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:41:03,740 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-03-04 16:41:03,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:03,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:03,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:03,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:03,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:03,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:03,950 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:41:03,950 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-03-04 16:41:03,953 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:03,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:03,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:03,966 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:03,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:03,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:03,967 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-03-04 16:41:03,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:03,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:03,984 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:41:03,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:04,159 INFO L453 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 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:41:04,161 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,246 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,266 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,278 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,343 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,420 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,481 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,558 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,925 INFO L453 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-03-04 16:41:04,942 INFO L453 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 35 [2019-03-04 16:41:04,967 INFO L453 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 37 [2019-03-04 16:41:04,992 INFO L453 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 39 [2019-03-04 16:41:05,002 INFO L453 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 41 [2019-03-04 16:41:05,021 INFO L453 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 43 [2019-03-04 16:41:05,048 INFO L453 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 45 [2019-03-04 16:41:05,067 INFO L453 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 47 [2019-03-04 16:41:05,290 INFO L453 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 8 new quantified variables, introduced 16 case distinctions, treesize of input 47 treesize of output 70 [2019-03-04 16:41:05,292 INFO L309 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,311 INFO L309 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,331 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,351 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,370 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,389 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,408 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,446 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,481 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,583 INFO L309 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-03-04 16:41:05,583 INFO L209 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-03-04 16:41:05,720 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-03-04 16:41:05,737 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:41:05,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,850 INFO L309 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-03-04 16:41:05,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:127 [2019-03-04 16:41:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:05,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:06,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:06,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:41:06,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:06,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:41:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:41:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:41:06,023 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-03-04 16:41:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:17,219 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-03-04 16:41:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:41:17,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:41:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:17,223 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:41:17,223 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:41:17,224 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-03-04 16:41:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:41:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-03-04 16:41:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:41:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2019-03-04 16:41:17,230 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 69 transitions. Word has length 3 [2019-03-04 16:41:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:17,231 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 69 transitions. [2019-03-04 16:41:17,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:41:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 69 transitions. [2019-03-04 16:41:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:41:17,231 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:17,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:41:17,232 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:17,232 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2019-03-04 16:41:17,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:17,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:17,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:17,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:41:17,345 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2019-03-04 16:41:17,346 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:17,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:17,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:17,356 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:17,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:17,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:17,356 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-03-04 16:41:17,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:17,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:17,374 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:41:17,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:17,388 INFO L453 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-03-04 16:41:17,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,413 INFO L453 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 35 [2019-03-04 16:41:17,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,426 INFO L453 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 37 [2019-03-04 16:41:17,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,443 INFO L453 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 39 [2019-03-04 16:41:17,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,490 INFO L453 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 41 [2019-03-04 16:41:17,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,527 INFO L453 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 43 [2019-03-04 16:41:17,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,565 INFO L453 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 45 [2019-03-04 16:41:17,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,620 INFO L453 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 47 [2019-03-04 16:41:17,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,753 INFO L453 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 8 new quantified variables, introduced 16 case distinctions, treesize of input 47 treesize of output 70 [2019-03-04 16:41:17,755 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,776 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,797 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,817 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,841 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,862 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,886 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,911 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,935 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,055 INFO L453 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 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:41:18,056 INFO L309 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,086 INFO L309 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,098 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,124 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,165 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,229 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,291 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,358 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,463 INFO L309 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-03-04 16:41:18,463 INFO L209 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-03-04 16:41:19,943 WARN L181 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 88 [2019-03-04 16:41:20,032 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 24 case distinctions, treesize of input 56 treesize of output 107 [2019-03-04 16:41:20,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-03-04 16:41:20,114 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 256 xjuncts. [2019-03-04 16:41:22,892 INFO L309 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-03-04 16:41:22,893 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:168, output treesize:1383 [2019-03-04 16:41:33,674 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:41:33,875 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:33,876 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.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) 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) ... 45 more [2019-03-04 16:41:33,881 INFO L168 Benchmark]: Toolchain (without parser) took 46870.51 ms. Allocated memory was 134.7 MB in the beginning and 360.7 MB in the end (delta: 226.0 MB). Free memory was 110.0 MB in the beginning and 295.9 MB in the end (delta: -185.9 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:41:33,882 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.58 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:41:33,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 134.7 MB. Free memory was 109.8 MB in the beginning and 107.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:41:33,883 INFO L168 Benchmark]: Boogie Preprocessor took 44.83 ms. Allocated memory is still 134.7 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:41:33,884 INFO L168 Benchmark]: RCFGBuilder took 574.42 ms. Allocated memory is still 134.7 MB. Free memory was 106.0 MB in the beginning and 92.5 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:41:33,885 INFO L168 Benchmark]: TraceAbstraction took 46174.39 ms. Allocated memory was 134.7 MB in the beginning and 360.7 MB in the end (delta: 226.0 MB). Free memory was 92.3 MB in the beginning and 295.9 MB in the end (delta: -203.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:41:33,889 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.58 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 134.7 MB. Free memory was 109.8 MB in the beginning and 107.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.83 ms. Allocated memory is still 134.7 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 574.42 ms. Allocated memory is still 134.7 MB. Free memory was 106.0 MB in the beginning and 92.5 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46174.39 ms. Allocated memory was 134.7 MB in the beginning and 360.7 MB in the end (delta: 226.0 MB). Free memory was 92.3 MB in the beginning and 295.9 MB in the end (delta: -203.6 MB). Peak memory consumption was 22.3 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...