java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-4b9831f [2018-12-23 14:19:40,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:19:40,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:19:40,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:19:40,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:19:40,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:19:40,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:19:40,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:19:40,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:19:40,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:19:40,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:19:40,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:19:40,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:19:40,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:19:40,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:19:40,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:19:40,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:19:40,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:19:40,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:19:40,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:19:40,830 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:19:40,831 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:19:40,833 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:19:40,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:19:40,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:19:40,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:19:40,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:19:40,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:19:40,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:19:40,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:19:40,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:19:40,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:19:40,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:19:40,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:19:40,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:19:40,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:19:40,847 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-23 14:19:40,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:19:40,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:19:40,875 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:19:40,875 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:19:40,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:19:40,879 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:19:40,879 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:19:40,880 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:19:40,880 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-23 14:19:40,880 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:19:40,880 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-23 14:19:40,881 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-23 14:19:40,881 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:19:40,881 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:19:40,882 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:19:40,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:19:40,882 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:19:40,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:19:40,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:19:40,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:19:40,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:19:40,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:19:40,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:19:40,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:19:40,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:19:40,887 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:19:40,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:19:40,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:19:40,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:19:40,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:19:40,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:19:40,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:19:40,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:19:40,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:19:40,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:19:40,889 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:19:40,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:19:40,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:19:40,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:19:40,890 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:19:40,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:19:40,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:19:40,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:19:40,946 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:19:40,947 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:19:40,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl [2018-12-23 14:19:40,947 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl' [2018-12-23 14:19:40,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:19:40,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:19:40,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:19:40,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:19:40,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:19:41,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:19:41,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:19:41,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:19:41,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:19:41,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/1) ... [2018-12-23 14:19:41,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:19:41,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:19:41,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:19:41,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:19:41,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19: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 [2018-12-23 14:19:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-23 14:19:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-23 14:19:42,314 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-23 14:19:42,315 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-12-23 14:19:42,315 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:19:42 BoogieIcfgContainer [2018-12-23 14:19:42,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:19:42,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:19:42,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:19:42,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:19:42,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:19:40" (1/2) ... [2018-12-23 14:19:42,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a61fac0 and model type speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:19:42, skipping insertion in model container [2018-12-23 14:19:42,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:19:42" (2/2) ... [2018-12-23 14:19:42,324 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-limited.bpl [2018-12-23 14:19:42,335 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:19:42,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-23 14:19:42,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-23 14:19:42,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:19:42,410 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:19:42,410 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:19:42,410 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:19:42,410 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:19:42,410 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:19:42,410 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:19:42,411 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:19:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-23 14:19:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-23 14:19:42,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:19:42,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-23 14:19:42,457 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:19:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:19:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2018-12-23 14:19:42,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:19:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:19:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:19:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:19:42,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:19:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:19:42,814 INFO L273 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-23 14:19:42,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {25#false} is VALID [2018-12-23 14:19:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:19:42,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:19:42,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-23 14:19:42,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:19:42,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-23 14:19:42,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:19:42,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:19:42,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:19:42,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:19:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:19:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:19:42,870 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-23 14:19:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:19:43,290 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2018-12-23 14:19:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:19:43,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-23 14:19:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:19:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:19:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-12-23 14:19:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:19:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-12-23 14:19:43,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2018-12-23 14:19:43,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:19:43,772 INFO L225 Difference]: With dead ends: 41 [2018-12-23 14:19:43,772 INFO L226 Difference]: Without dead ends: 36 [2018-12-23 14:19:43,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:19:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-23 14:19:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-23 14:19:43,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:19:43,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2018-12-23 14:19:43,821 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2018-12-23 14:19:43,821 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2018-12-23 14:19:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:19:43,830 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2018-12-23 14:19:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-23 14:19:43,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:19:43,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:19:43,831 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2018-12-23 14:19:43,832 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2018-12-23 14:19:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:19:43,836 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2018-12-23 14:19:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-23 14:19:43,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:19:43,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:19:43,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:19:43,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:19:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-23 14:19:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-23 14:19:43,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2018-12-23 14:19:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:19:43,842 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-23 14:19:43,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:19:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-23 14:19:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-23 14:19:43,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:19:43,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-23 14:19:43,844 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:19:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:19:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2018-12-23 14:19:43,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:19:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:19:43,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:19:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:19:43,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:19:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:19:44,058 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {168#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-23 14:19:44,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-23 14:19:44,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2018-12-23 14:19:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:19:44,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:19:44,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:19:44,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-23 14:19:44,089 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2018-12-23 14:19:44,125 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-23 14:19:44,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:19:44,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-23 14:19:44,274 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-23 14:19:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:19:44,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-23 14:19:44,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:19:44,289 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 [2018-12-23 14:19:44,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:19:44,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-23 14:19:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:19:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:19:44,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:19:44,949 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-12-23 14:19:44,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-12-23 14:19:44,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2018-12-23 14:19:45,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2018-12-23 14:19:45,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2018-12-23 14:19:45,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2018-12-23 14:19:45,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2018-12-23 14:19:45,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2018-12-23 14:19:45,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2018-12-23 14:19:45,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:45,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 190 [2018-12-23 14:19:45,768 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-23 14:19:45,926 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,123 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,232 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:46,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 95 [2018-12-23 14:19:46,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2018-12-23 14:19:46,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 78 [2018-12-23 14:19:46,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:46,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2018-12-23 14:19:46,951 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-23 14:19:47,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2018-12-23 14:19:47,251 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-23 14:19:47,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2018-12-23 14:19:47,702 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-23 14:19:47,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:47,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2018-12-23 14:19:47,824 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-23 14:19:47,851 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:47,875 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:47,878 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:47,880 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:47,883 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:47,895 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-23 14:19:47,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-23 14:19:47,949 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:149, output treesize:70 [2018-12-23 14:19:50,114 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:19:50,114 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, |v_#valid_11|]. (let ((.cse0 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store (store (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1))) (let ((.cse3 (store .cse2 ULTIMATE.start_main_p5 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p6 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (select (store .cse1 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse2 ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select .cse3 ULTIMATE.start_main_p6)) (= (store (store (store (store (store (store (store (store (store |v_#memory_int_47| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) |#memory_int|) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select .cse1 ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2018-12-23 14:19:50,114 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-23 14:19:52,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-23 14:19:52,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 190 [2018-12-23 14:19:52,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-23 14:19:52,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-23 14:19:52,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:80, output treesize:70 [2018-12-23 14:19:54,745 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:19:54,746 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2, ULTIMATE.start_main_p8]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p9)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p7)) (= (store |v_#memory_int_48| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p3)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p8)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 .cse0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-23 14:19:54,746 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-23 14:20:00,669 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {173#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2018-12-23 14:20:03,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {177#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is UNKNOWN [2018-12-23 14:20:03,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2018-12-23 14:20:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:20:03,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:20:03,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2018-12-23 14:20:03,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-23 14:20:03,504 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {185#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-23 14:20:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:20:03,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:20:03,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-23 14:20:03,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:20:03,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-23 14:20:03,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:20:03,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-23 14:20:06,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-23 14:20:06,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-23 14:20:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-23 14:20:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2018-12-23 14:20:06,563 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2018-12-23 14:20:13,897 WARN L181 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-12-23 14:20:17,263 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-23 14:20:17,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:20:17,265 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.predicates.PredicateUtils.isInductiveHelper(PredicateUtils.java:346) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:163) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.reviewInductiveInternal(EfficientHoareTripleChecker.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: 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) ... 43 more [2018-12-23 14:20:17,269 INFO L168 Benchmark]: Toolchain (without parser) took 36272.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -225.4 MB). Peak memory consumption was 477.7 MB. Max. memory is 7.1 GB. [2018-12-23 14:20:17,271 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:20:17,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:20:17,272 INFO L168 Benchmark]: Boogie Preprocessor took 46.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:20:17,272 INFO L168 Benchmark]: RCFGBuilder took 1179.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-23 14:20:17,273 INFO L168 Benchmark]: TraceAbstraction took 34950.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -267.7 MB). Peak memory consumption was 435.4 MB. Max. memory is 7.1 GB. [2018-12-23 14:20:17,281 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 91.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1179.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34950.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -267.7 MB). Peak memory consumption was 435.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory: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...