java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:17:39,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:17:39,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:17:39,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:17:39,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:17:39,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:17:39,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:17:39,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:17:39,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:17:39,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:17:39,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:17:39,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:17:39,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:17:39,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:17:39,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:17:39,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:17:39,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:17:39,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:17:39,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:17:39,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:17:39,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:17:40,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:17:40,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:17:40,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:17:40,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:17:40,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:17:40,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:17:40,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:17:40,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:17:40,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:17:40,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:17:40,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:17:40,010 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:17:40,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:17:40,014 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:17:40,015 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:17:40,016 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:17:40,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:17:40,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:17:40,032 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:17:40,032 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:17:40,033 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:17:40,033 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:17:40,034 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:17:40,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:17:40,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:17:40,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:17:40,035 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:17:40,035 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:17:40,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:17:40,035 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:17:40,035 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:17:40,036 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:17:40,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:17:40,036 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:17:40,036 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:17:40,036 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:17:40,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:17:40,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:17:40,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:17:40,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:17:40,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:17:40,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:17:40,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:17:40,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:17:40,038 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:17:40,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:17:40,039 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:17:40,039 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:17:40,039 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:17:40,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:17:40,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:17:40,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:17:40,103 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:17:40,104 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:17:40,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:40,169 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b50ab28b/681b22649e6745ae9afa7dc6e19db971/FLAGf6576cc65 [2018-11-23 11:17:40,772 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:17:40,773 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:40,788 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b50ab28b/681b22649e6745ae9afa7dc6e19db971/FLAGf6576cc65 [2018-11-23 11:17:41,016 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b50ab28b/681b22649e6745ae9afa7dc6e19db971 [2018-11-23 11:17:41,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:17:41,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:17:41,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:17:41,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:17:41,034 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:17:41,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738aa8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41, skipping insertion in model container [2018-11-23 11:17:41,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:17:41,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:17:41,523 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:17:41,543 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:17:41,603 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:17:41,687 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:17:41,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41 WrapperNode [2018-11-23 11:17:41,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:17:41,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:17:41,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:17:41,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:17:41,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:17:41,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:17:41,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:17:41,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:17:41,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (1/1) ... [2018-11-23 11:17:41,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:17:41,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:17:41,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:17:41,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:17:41,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (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-11-23 11:17:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:17:41,914 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:17:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:17:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:17:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:17:41,914 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:17:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:17:41,915 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:17:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:17:41,915 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:17:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:17:41,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:17:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:17:41,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:17:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:17:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:17:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2018-11-23 11:17:41,916 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2018-11-23 11:17:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:17:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:17:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:17:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:17:41,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:17:43,048 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:17:43,049 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:17:43,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:17:43 BoogieIcfgContainer [2018-11-23 11:17:43,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:17:43,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:17:43,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:17:43,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:17:43,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:17:41" (1/3) ... [2018-11-23 11:17:43,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235d1764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:17:43, skipping insertion in model container [2018-11-23 11:17:43,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:41" (2/3) ... [2018-11-23 11:17:43,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235d1764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:17:43, skipping insertion in model container [2018-11-23 11:17:43,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:17:43" (3/3) ... [2018-11-23 11:17:43,059 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:43,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:17:43,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:17:43,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:17:43,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:17:43,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:17:43,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:17:43,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:17:43,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:17:43,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:17:43,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:17:43,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:17:43,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:17:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 11:17:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:17:43,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:43,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:43,157 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:43,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:43,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2000133616, now seen corresponding path program 1 times [2018-11-23 11:17:43,167 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:43,168 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:43,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:17:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:43,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:43,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2018-11-23 11:17:43,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {50#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {50#true} is VALID [2018-11-23 11:17:43,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {50#true} assume true; {50#true} is VALID [2018-11-23 11:17:43,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50#true} {50#true} #104#return; {50#true} is VALID [2018-11-23 11:17:43,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {50#true} call #t~ret16 := main(); {50#true} is VALID [2018-11-23 11:17:43,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {50#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {70#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:43,600 INFO L256 TraceCheckUtils]: 6: Hoare triple {70#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {50#true} is VALID [2018-11-23 11:17:43,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {50#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {77#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:43,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {77#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {81#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:43,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {81#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {81#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:43,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {81#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {81#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:43,662 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {81#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {70#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #94#return; {51#false} is VALID [2018-11-23 11:17:43,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {51#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;~uneq~0 := 5bv32; {51#false} is VALID [2018-11-23 11:17:43,663 INFO L256 TraceCheckUtils]: 13: Hoare triple {51#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {51#false} is VALID [2018-11-23 11:17:43,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {51#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {51#false} is VALID [2018-11-23 11:17:43,664 INFO L256 TraceCheckUtils]: 15: Hoare triple {51#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {51#false} is VALID [2018-11-23 11:17:43,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {51#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {51#false} is VALID [2018-11-23 11:17:43,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {51#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {51#false} is VALID [2018-11-23 11:17:43,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {51#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {51#false} is VALID [2018-11-23 11:17:43,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {51#false} assume true; {51#false} is VALID [2018-11-23 11:17:43,666 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {51#false} {51#false} #100#return; {51#false} is VALID [2018-11-23 11:17:43,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {51#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {51#false} is VALID [2018-11-23 11:17:43,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {51#false} assume true; {51#false} is VALID [2018-11-23 11:17:43,667 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {51#false} {51#false} #96#return; {51#false} is VALID [2018-11-23 11:17:43,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {51#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~mem10 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {51#false} is VALID [2018-11-23 11:17:43,668 INFO L273 TraceCheckUtils]: 25: Hoare triple {51#false} assume ~uneq~0 != #t~mem10;havoc #t~mem10; {51#false} is VALID [2018-11-23 11:17:43,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {51#false} assume !false; {51#false} is VALID [2018-11-23 11:17:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:17:43,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:17:43,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:17:43,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:17:43,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 11:17:43,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:43,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:17:43,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:43,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:17:43,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:17:43,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:17:43,893 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2018-11-23 11:17:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:45,527 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-23 11:17:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:17:45,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 11:17:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:17:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2018-11-23 11:17:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:17:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2018-11-23 11:17:45,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2018-11-23 11:17:45,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:45,864 INFO L225 Difference]: With dead ends: 89 [2018-11-23 11:17:45,865 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:17:45,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:17:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:17:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-23 11:17:46,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:46,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-23 11:17:46,111 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-23 11:17:46,112 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-23 11:17:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:46,118 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 11:17:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:17:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:46,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:46,120 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-23 11:17:46,120 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-23 11:17:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:46,126 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 11:17:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:17:46,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:46,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:46,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:46,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:17:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 11:17:46,134 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2018-11-23 11:17:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:46,134 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 11:17:46,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:17:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:17:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:17:46,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:46,136 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:46,137 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:46,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2057530304, now seen corresponding path program 1 times [2018-11-23 11:17:46,138 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:46,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:17:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:46,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:46,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-23 11:17:46,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {386#true} is VALID [2018-11-23 11:17:46,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-23 11:17:46,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #104#return; {386#true} is VALID [2018-11-23 11:17:46,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret16 := main(); {386#true} is VALID [2018-11-23 11:17:46,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {406#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:46,471 INFO L256 TraceCheckUtils]: 6: Hoare triple {406#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {386#true} is VALID [2018-11-23 11:17:46,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {413#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:46,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {413#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {413#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:46,473 INFO L256 TraceCheckUtils]: 9: Hoare triple {413#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {386#true} is VALID [2018-11-23 11:17:46,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {386#true} is VALID [2018-11-23 11:17:46,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {386#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {386#true} is VALID [2018-11-23 11:17:46,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {386#true} is VALID [2018-11-23 11:17:46,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-23 11:17:46,476 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {386#true} {413#(= |sll_create_#in~len| sll_create_~len)} #102#return; {413#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:46,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {413#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {413#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:46,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {413#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {441#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:17:46,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {441#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,524 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {406#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #94#return; {387#false} is VALID [2018-11-23 11:17:46,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {387#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;~uneq~0 := 5bv32; {387#false} is VALID [2018-11-23 11:17:46,525 INFO L256 TraceCheckUtils]: 22: Hoare triple {387#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {387#false} is VALID [2018-11-23 11:17:46,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {387#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {387#false} is VALID [2018-11-23 11:17:46,525 INFO L256 TraceCheckUtils]: 24: Hoare triple {387#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {387#false} is VALID [2018-11-23 11:17:46,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {387#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {387#false} is VALID [2018-11-23 11:17:46,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {387#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {387#false} is VALID [2018-11-23 11:17:46,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {387#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {387#false} is VALID [2018-11-23 11:17:46,527 INFO L273 TraceCheckUtils]: 28: Hoare triple {387#false} assume true; {387#false} is VALID [2018-11-23 11:17:46,527 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {387#false} {387#false} #100#return; {387#false} is VALID [2018-11-23 11:17:46,527 INFO L273 TraceCheckUtils]: 30: Hoare triple {387#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {387#false} is VALID [2018-11-23 11:17:46,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {387#false} assume true; {387#false} is VALID [2018-11-23 11:17:46,530 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {387#false} {387#false} #96#return; {387#false} is VALID [2018-11-23 11:17:46,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {387#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~mem10 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {387#false} is VALID [2018-11-23 11:17:46,531 INFO L273 TraceCheckUtils]: 34: Hoare triple {387#false} assume ~uneq~0 != #t~mem10;havoc #t~mem10; {387#false} is VALID [2018-11-23 11:17:46,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-23 11:17:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:17:46,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:17:46,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-23 11:17:46,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {387#false} assume ~uneq~0 != #t~mem10;havoc #t~mem10; {387#false} is VALID [2018-11-23 11:17:46,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {387#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~mem10 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {387#false} is VALID [2018-11-23 11:17:46,906 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {386#true} {387#false} #96#return; {387#false} is VALID [2018-11-23 11:17:46,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-23 11:17:46,907 INFO L273 TraceCheckUtils]: 30: Hoare triple {386#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {386#true} is VALID [2018-11-23 11:17:46,907 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {386#true} {386#true} #100#return; {386#true} is VALID [2018-11-23 11:17:46,908 INFO L273 TraceCheckUtils]: 28: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-23 11:17:46,908 INFO L273 TraceCheckUtils]: 27: Hoare triple {386#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {386#true} is VALID [2018-11-23 11:17:46,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {386#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {386#true} is VALID [2018-11-23 11:17:46,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {386#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {386#true} is VALID [2018-11-23 11:17:46,909 INFO L256 TraceCheckUtils]: 24: Hoare triple {386#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {386#true} is VALID [2018-11-23 11:17:46,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {386#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {386#true} is VALID [2018-11-23 11:17:46,909 INFO L256 TraceCheckUtils]: 22: Hoare triple {387#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {386#true} is VALID [2018-11-23 11:17:46,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {387#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;~uneq~0 := 5bv32; {387#false} is VALID [2018-11-23 11:17:46,915 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {545#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #94#return; {387#false} is VALID [2018-11-23 11:17:46,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {558#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {445#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {558#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:17:46,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,944 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {386#true} {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #102#return; {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-23 11:17:46,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {386#true} is VALID [2018-11-23 11:17:46,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {386#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {386#true} is VALID [2018-11-23 11:17:46,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {386#true} is VALID [2018-11-23 11:17:46,946 INFO L256 TraceCheckUtils]: 9: Hoare triple {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {386#true} is VALID [2018-11-23 11:17:46,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {562#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:46,958 INFO L256 TraceCheckUtils]: 6: Hoare triple {545#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {386#true} is VALID [2018-11-23 11:17:46,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {545#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:46,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret16 := main(); {386#true} is VALID [2018-11-23 11:17:46,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #104#return; {386#true} is VALID [2018-11-23 11:17:46,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-23 11:17:46,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {386#true} is VALID [2018-11-23 11:17:46,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-23 11:17:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:17:46,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:17:46,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:17:46,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 11:17:46,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:46,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:17:47,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:47,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:17:47,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:17:47,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:17:47,099 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 9 states. [2018-11-23 11:17:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:48,204 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 11:17:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:17:48,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 11:17:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:17:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 11:17:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:17:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 11:17:48,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2018-11-23 11:17:48,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:48,379 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:17:48,380 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:17:48,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:17:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:17:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 11:17:48,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:48,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-23 11:17:48,404 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-23 11:17:48,405 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-23 11:17:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:48,409 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:17:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:17:48,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:48,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:48,411 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-23 11:17:48,412 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-23 11:17:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:48,416 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 11:17:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 11:17:48,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:48,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:48,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:48,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:17:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 11:17:48,421 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 36 [2018-11-23 11:17:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:48,421 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 11:17:48,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:17:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:17:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:17:48,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:48,424 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:48,424 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:48,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash 157267952, now seen corresponding path program 2 times [2018-11-23 11:17:48,425 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:48,425 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:48,445 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:17:48,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:17:48,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:17:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:48,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:48,781 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:17:48,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:48,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:48,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:17:48,810 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:48,811 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_52|]. (and (= |#valid| (store |v_#valid_52| |main_~#s~0.base| (_ bv1 1))) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:17:48,811 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:17:50,948 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-23 11:17:53,118 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#t~ret4.base| (_ bv1 1))))) is different from true [2018-11-23 11:17:57,489 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:17:57,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:57,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:57,572 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 22 treesize of output 29 [2018-11-23 11:17:57,595 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 11:17:57,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:57,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:57,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:17:57,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:23 [2018-11-23 11:17:57,706 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:57,706 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|, sll_create_~new_head~0.base]. (and (= (store (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)) |#valid|) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) (_ bv1 1))) (= (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|) (_ bv0 1))) [2018-11-23 11:17:57,706 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|, sll_create_~new_head~0.base]. (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|))) [2018-11-23 11:18:00,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 11 treesize of output 8 [2018-11-23 11:18:00,752 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:18:00,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:00,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:00,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:00,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 11:18:04,553 INFO L303 Elim1Store]: Index analysis took 374 ms [2018-11-23 11:18:04,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-23 11:18:04,646 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 11:18:04,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 29 [2018-11-23 11:18:06,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:07,692 INFO L303 Elim1Store]: Index analysis took 221 ms [2018-11-23 11:18:07,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:18:07,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:18:07,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:07,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:08,865 INFO L303 Elim1Store]: Index analysis took 306 ms [2018-11-23 11:18:08,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 11:18:08,924 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 11:18:08,926 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:09,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 11:18:09,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 11:18:09,786 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:18:10,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:10,460 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:10,497 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:10,868 INFO L303 Elim1Store]: Index analysis took 194 ms [2018-11-23 11:18:10,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-23 11:18:10,943 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 11:18:10,945 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:11,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 25 treesize of output 29 [2018-11-23 11:18:11,545 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:12,254 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-11-23 11:18:12,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 34 [2018-11-23 11:18:12,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 11:18:12,369 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 11:18:12,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 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 19 treesize of output 22 [2018-11-23 11:18:12,697 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:12,807 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:18:13,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 11:18:13,257 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-11-23 11:18:13,259 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:13,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-23 11:18:13,514 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-23 11:18:13,583 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:13,645 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:13,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 11:18:13,758 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-11-23 11:18:13,779 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:13,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-23 11:18:13,884 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-11-23 11:18:13,886 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 30 [2018-11-23 11:18:14,021 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-11-23 11:18:14,086 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:18:14,141 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:18:14,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:18:14,211 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 5 variables, input treesize:113, output treesize:90 [2018-11-23 11:18:19,253 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:19,254 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_49|, sll_prepend_~new_head~1.base, |v_#memory_int_48|, |v_#memory_int_49|, |v_#memory_$Pointer$.offset_49|]. (let ((.cse1 (select |v_#memory_int_49| sll_prepend_~new_head~1.base))) (and (= |#memory_$Pointer$.base| (let ((.cse0 (store |v_#memory_$Pointer$.base_49| sll_prepend_~new_head~1.base (store (select |v_#memory_$Pointer$.base_49| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select |v_#memory_$Pointer$.base_49| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))) (store .cse0 |sll_prepend_#in~head.base| (store (select .cse0 |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (store |v_#memory_int_48| |sll_prepend_#in~head.base| (store (select |v_#memory_int_48| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| (select (select |#memory_int| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |#memory_int|) (= (select |old(#valid)| sll_prepend_~new_head~1.base) (_ bv0 1)) (= |sll_prepend_#in~data| (select .cse1 (_ bv0 32))) (= (store |v_#memory_int_49| sll_prepend_~new_head~1.base (store .cse1 (_ bv4 32) (select (select |v_#memory_int_48| sll_prepend_~new_head~1.base) (_ bv4 32)))) |v_#memory_int_48|) (= (let ((.cse2 (store |v_#memory_$Pointer$.offset_49| sll_prepend_~new_head~1.base (store (select |v_#memory_$Pointer$.offset_49| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select |v_#memory_$Pointer$.offset_49| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))) (store .cse2 |sll_prepend_#in~head.base| (store (select .cse2 |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| (_ bv0 32)))) |#memory_$Pointer$.offset|))) [2018-11-23 11:18:19,254 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (let ((.cse0 (= (_ bv0 1) (select |old(#valid)| .cse2))) (.cse1 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (.cse3 (= .cse2 |sll_prepend_#in~head.base|))) (or (and .cse0 .cse1 (= |sll_prepend_#in~data| (select (select |#memory_int| .cse2) (_ bv0 32)))) (and .cse0 .cse1 (= (_ bv4 32) |sll_prepend_#in~head.offset|) .cse3 (= |sll_prepend_#in~data| (select (select |#memory_int| |sll_prepend_#in~head.base|) (_ bv0 32)))) (and .cse0 .cse1 .cse3 (= (_ bv0 32) |sll_prepend_#in~head.offset|))))) [2018-11-23 11:18:21,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:21,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:21,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:21,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-11-23 11:18:21,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:35 [2018-11-23 11:18:21,239 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:21,240 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_9, v_prenex_10, |v_old(#valid)_AFTER_CALL_23|, |node_create_#t~malloc2.base|]. (let ((.cse0 (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32))) (.cse1 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse2 (= |main_~#s~0.offset| (_ bv0 32)))) (or (and (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_23| |main_~#s~0.base|)) .cse0 .cse1 .cse2 (= (_ bv0 1) (select |v_old(#valid)_AFTER_CALL_23| .cse3)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= |main_~#s~0.base| .cse3) (= (_ bv1 1) (select |v_old(#valid)_AFTER_CALL_23| |node_create_#t~malloc2.base|))) (and (= (select (select |#memory_int| .cse3) (_ bv0 32)) main_~uneq~0) (= (_ bv1 1) (select v_prenex_9 v_prenex_10)) .cse0 .cse1 (= (_ bv0 1) (select v_prenex_9 .cse3)) .cse2 (not (= v_prenex_10 |main_~#s~0.base|)) (= (_ bv1 1) (select v_prenex_9 |main_~#s~0.base|))))) [2018-11-23 11:18:21,240 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| .cse0)))) [2018-11-23 11:18:21,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2018-11-23 11:18:21,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:18:21,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 7 treesize of output 5 [2018-11-23 11:18:21,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 8 treesize of output 6 [2018-11-23 11:18:21,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2018-11-23 11:18:21,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:21,511 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2018-11-23 11:18:21,515 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:21,515 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_int|, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (.cse2 (select |#memory_int| .cse1))) (and (= (_ bv0 32) .cse0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= |main_~#s~0.base| .cse1)) (= |main_#t~mem10| (select .cse2 .cse0)) (= main_~uneq~0 (select .cse2 (_ bv0 32)))))) [2018-11-23 11:18:21,515 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem10| main_~uneq~0)) [2018-11-23 11:18:23,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {842#true} call ULTIMATE.init(); {842#true} is VALID [2018-11-23 11:18:23,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {842#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {842#true} is VALID [2018-11-23 11:18:23,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {842#true} assume true; {842#true} is VALID [2018-11-23 11:18:23,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {842#true} {842#true} #104#return; {842#true} is VALID [2018-11-23 11:18:23,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {842#true} call #t~ret16 := main(); {842#true} is VALID [2018-11-23 11:18:23,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {842#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {862#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:23,642 INFO L256 TraceCheckUtils]: 6: Hoare triple {862#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {866#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:23,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {866#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {866#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:23,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {866#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {866#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:23,644 INFO L256 TraceCheckUtils]: 9: Hoare triple {866#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {866#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:23,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {866#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,649 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {866#(= |#valid| |old(#valid)|)} #102#return; {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !!~bvsgt32(~len, 0bv32); {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,652 INFO L256 TraceCheckUtils]: 18: Hoare triple {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {866#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:23,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {866#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {907#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:23,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {907#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {907#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:23,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {907#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {914#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:23,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {914#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} assume true; {914#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:23,673 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {914#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} {879#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #102#return; {921#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {921#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} assume !~bvsgt32(~len, 0bv32); {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} assume true; {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:23,687 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {925#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} {862#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #94#return; {941#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:23,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {941#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset;~uneq~0 := 5bv32; {945#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:23,690 INFO L256 TraceCheckUtils]: 31: Hoare triple {945#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {866#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:23,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {866#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {952#(and (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-23 11:18:23,700 INFO L256 TraceCheckUtils]: 33: Hoare triple {952#(and (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {866#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:23,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {866#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {959#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:18:23,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {959#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {959#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:18:23,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {959#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {966#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:23,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {966#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {966#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:23,706 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {966#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {952#(and (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} #100#return; {973#(and (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) (_ bv0 32)) |sll_prepend_#in~data|) (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-23 11:18:23,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {973#(and (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) (_ bv0 32)) |sll_prepend_#in~data|) (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {977#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-23 11:18:23,712 INFO L273 TraceCheckUtils]: 40: Hoare triple {977#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} assume true; {977#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-23 11:18:23,714 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {977#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} {945#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} #96#return; {984#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:18:23,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {984#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~mem10 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {988#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem10| main_~uneq~0))} is VALID [2018-11-23 11:18:23,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {988#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_#t~mem10| main_~uneq~0))} assume ~uneq~0 != #t~mem10;havoc #t~mem10; {843#false} is VALID [2018-11-23 11:18:23,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {843#false} assume !false; {843#false} is VALID [2018-11-23 11:18:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 13 not checked. [2018-11-23 11:18:23,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:18:26,355 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:18:28,812 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 84 [2018-11-23 11:18:29,605 WARN L180 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:18:30,991 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 11:18:32,182 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:18:33,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:33,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:33,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 treesize of output 16 [2018-11-23 11:18:33,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-11-23 11:18:33,169 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-11-23 11:18:33,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:33,213 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:33,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 11:18:33,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:33,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 11:18:33,262 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 16 treesize of output 12 [2018-11-23 11:18:33,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2018-11-23 11:18:33,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,297 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,309 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:33,343 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:49, output treesize:11 [2018-11-23 11:18:33,422 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:33,423 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_64|, v_sll_prepend_~new_head~1.base_7, |v_#memory_int_65|, |v_#memory_int_66|]. (or (= main_~uneq~0 (select (select |v_#memory_int_66| v_sll_prepend_~new_head~1.base_7) (_ bv0 32))) (not (= |v_#memory_int_65| (store |v_#memory_int_64| v_sll_prepend_~new_head~1.base_7 (store (store (select |v_#memory_int_64| v_sll_prepend_~new_head~1.base_7) (_ bv0 32) main_~uneq~0) (_ bv4 32) (select (select |v_#memory_int_65| v_sll_prepend_~new_head~1.base_7) (_ bv4 32)))))) (not (= (_ bv0 1) (select |#valid| v_sll_prepend_~new_head~1.base_7))) (not (= |v_#memory_int_66| (store |v_#memory_int_65| |main_~#s~0.base| (store (select |v_#memory_int_65| |main_~#s~0.base|) |main_~#s~0.offset| (select (select |v_#memory_int_66| |main_~#s~0.base|) |main_~#s~0.offset|)))))) [2018-11-23 11:18:33,423 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (or (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.offset| (_ bv0 32)))) [2018-11-23 11:18:37,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:37,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:37,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:37,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:37,894 INFO L303 Elim1Store]: Index analysis took 148 ms [2018-11-23 11:18:38,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 125 [2018-11-23 11:18:39,097 WARN L180 SmtUtils]: Spent 857.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-23 11:18:39,118 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 157 [2018-11-23 11:18:39,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:39,134 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2018-11-23 11:18:39,142 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:39,150 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-11-23 11:18:39,154 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:39,165 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2018-11-23 11:18:39,169 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,349 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 105 treesize of output 110 [2018-11-23 11:18:41,357 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 105 treesize of output 110 [2018-11-23 11:18:41,392 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:41,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 106 treesize of output 111 [2018-11-23 11:18:41,419 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:43,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 103 [2018-11-23 11:18:43,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-23 11:18:43,071 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:43,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 57 treesize of output 55 [2018-11-23 11:18:43,164 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:43,235 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:43,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 108 [2018-11-23 11:18:43,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-11-23 11:18:43,385 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:43,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 102 [2018-11-23 11:18:43,978 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:18:44,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 93 treesize of output 91 [2018-11-23 11:18:44,573 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:45,201 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 11:18:45,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 107 treesize of output 103 [2018-11-23 11:18:45,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-23 11:18:45,227 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:45,292 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 108 [2018-11-23 11:18:48,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-11-23 11:18:48,622 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,724 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:48,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 113 [2018-11-23 11:18:51,950 WARN L180 SmtUtils]: Spent 3.02 s on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:18:51,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-11-23 11:18:51,996 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:57,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 89 treesize of output 87 [2018-11-23 11:18:57,268 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:58,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 92 treesize of output 90 [2018-11-23 11:18:58,041 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:58,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 94 treesize of output 92 [2018-11-23 11:18:58,870 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:58,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 95 treesize of output 93 [2018-11-23 11:18:58,918 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:59,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 106 [2018-11-23 11:18:59,795 INFO L267 ElimStorePlain]: Start of recursive call 31: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-23 11:19:01,811 INFO L267 ElimStorePlain]: Start of recursive call 25: 5 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-11-23 11:19:02,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 121 [2018-11-23 11:19:13,136 WARN L180 SmtUtils]: Spent 10.97 s on a formula simplification that was a NOOP. DAG size: 123 [2018-11-23 11:19:13,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2018-11-23 11:19:13,231 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:13,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 156 [2018-11-23 11:19:13,362 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 11:19:13,454 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:19:13,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 102 [2018-11-23 11:19:13,507 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:40,958 INFO L303 Elim1Store]: Index analysis took 243 ms [2018-11-23 11:19:40,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 98 treesize of output 96 [2018-11-23 11:19:40,964 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:40,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 97 treesize of output 95 [2018-11-23 11:19:41,001 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:50,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 102 treesize of output 100 [2018-11-23 11:19:50,729 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:00,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 101 [2018-11-23 11:20:00,427 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:12,962 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:12,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 102 [2018-11-23 11:20:12,970 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:13,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2018-11-23 11:20:13,055 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:22,520 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:20:22,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 99 [2018-11-23 11:20:22,526 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:22,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2018-11-23 11:20:22,655 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:28,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2018-11-23 11:20:28,400 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:34,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 95 treesize of output 93 [2018-11-23 11:20:34,242 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:40,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 92 treesize of output 90 [2018-11-23 11:20:40,835 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:49,461 INFO L267 ElimStorePlain]: Start of recursive call 32: 9 dim-1 vars, End of recursive call: 16 dim-0 vars, and 15 xjuncts. [2018-11-23 11:21:22,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 115 [2018-11-23 11:21:22,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-23 11:21:22,780 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:23,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2018-11-23 11:21:23,604 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:24,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 92 treesize of output 90 [2018-11-23 11:21:24,438 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:25,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 95 [2018-11-23 11:21:25,149 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:26,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 95 treesize of output 93 [2018-11-23 11:21:26,131 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.