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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:04:03,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:04:03,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:04:03,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:04:03,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:04:03,126 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:04:03,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:04:03,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:04:03,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:04:03,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:04:03,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:04:03,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:04:03,139 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:04:03,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:04:03,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:04:03,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:04:03,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:04:03,155 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:04:03,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:04:03,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:04:03,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:04:03,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:04:03,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:04:03,169 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:04:03,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:04:03,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:04:03,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:04:03,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:04:03,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:04:03,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:04:03,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:04:03,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:04:03,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:04:03,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:04:03,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:04:03,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:04:03,182 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-18 22:04:03,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:04:03,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:04:03,210 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:04:03,210 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:04:03,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:04:03,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:04:03,212 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:04:03,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:04:03,212 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:04:03,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:04:03,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:04:03,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:04:03,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:04:03,214 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:04:03,215 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:04:03,215 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:04:03,215 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:04:03,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:04:03,216 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:04:03,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:04:03,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:04:03,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:04:03,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:04:03,217 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:04:03,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:04:03,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:04:03,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:04:03,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:04:03,219 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:04:03,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:04:03,219 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:04:03,220 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:04:03,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:04:03,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:04:03,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:04:03,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:04:03,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:04:03,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:04:03,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:04:03,393 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c4666c2/f755e179ecee4c0d88d872182f799247/FLAG9cce63e03 [2018-11-18 22:04:03,964 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:04:03,965 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:04:03,979 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c4666c2/f755e179ecee4c0d88d872182f799247/FLAG9cce63e03 [2018-11-18 22:04:04,226 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c4666c2/f755e179ecee4c0d88d872182f799247 [2018-11-18 22:04:04,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:04:04,239 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:04:04,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:04:04,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:04:04,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:04:04,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:04:04" (1/1) ... [2018-11-18 22:04:04,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdc6dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:04, skipping insertion in model container [2018-11-18 22:04:04,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:04:04" (1/1) ... [2018-11-18 22:04:04,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:04:04,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:04:04,771 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:04:04,795 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:04:04,864 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:04:05,042 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:04:05,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05 WrapperNode [2018-11-18 22:04:05,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:04:05,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:04:05,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:04:05,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:04:05,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (1/1) ... [2018-11-18 22:04:05,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (1/1) ... [2018-11-18 22:04:05,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (1/1) ... [2018-11-18 22:04:05,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (1/1) ... [2018-11-18 22:04:05,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (1/1) ... [2018-11-18 22:04:05,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (1/1) ... [2018-11-18 22:04:05,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (1/1) ... [2018-11-18 22:04:05,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:04:05,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:04:05,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:04:05,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:04:05,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (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-18 22:04:05,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:04:05,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:04:05,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:04:05,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:04:05,226 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:04:05,227 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:04:05,227 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-18 22:04:05,227 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-18 22:04:05,227 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2018-11-18 22:04:05,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:04:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:04:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:04:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:04:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:04:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:04:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:04:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:04:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:04:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:04:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:04:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:04:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:04:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:04:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:04:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:04:05,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:04:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:04:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:04:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:04:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:04:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:04:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:04:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:04:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:04:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:04:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:04:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:04:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:04:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:04:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:04:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:04:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:04:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:04:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:04:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:04:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:04:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:04:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:04:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:04:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:04:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:04:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:04:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:04:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:04:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:04:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:04:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:04:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:04:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:04:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:04:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:04:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:04:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:04:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:04:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:04:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:04:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:04:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:04:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:04:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:04:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:04:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:04:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:04:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:04:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:04:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:04:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:04:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:04:05,239 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:04:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:04:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:04:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:04:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:04:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:04:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:04:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:04:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:04:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:04:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:04:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:04:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:04:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:04:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:04:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:04:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:04:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:04:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:04:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:04:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:04:05,243 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:04:05,244 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2018-11-18 22:04:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:04:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:04:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:04:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:04:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:04:06,518 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:04:06,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:04:06 BoogieIcfgContainer [2018-11-18 22:04:06,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:04:06,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:04:06,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:04:06,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:04:06,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:04:04" (1/3) ... [2018-11-18 22:04:06,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e20c97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:04:06, skipping insertion in model container [2018-11-18 22:04:06,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:04:05" (2/3) ... [2018-11-18 22:04:06,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e20c97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:04:06, skipping insertion in model container [2018-11-18 22:04:06,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:04:06" (3/3) ... [2018-11-18 22:04:06,527 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:04:06,538 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:04:06,547 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:04:06,565 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:04:06,602 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:04:06,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:04:06,603 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:04:06,603 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:04:06,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:04:06,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:04:06,604 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:04:06,604 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:04:06,604 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:04:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-18 22:04:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:04:06,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:04:06,631 INFO L375 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] [2018-11-18 22:04:06,633 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:04:06,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:04:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash -579085372, now seen corresponding path program 1 times [2018-11-18 22:04:06,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:04:06,644 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-18 22:04:06,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:04:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:06,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:04:07,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {62#true} is VALID [2018-11-18 22:04:07,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {62#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {62#true} is VALID [2018-11-18 22:04:07,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2018-11-18 22:04:07,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #144#return; {62#true} is VALID [2018-11-18 22:04:07,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {62#true} call #t~ret24 := main(); {62#true} is VALID [2018-11-18 22:04:07,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {62#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {62#true} is VALID [2018-11-18 22:04:07,183 INFO L256 TraceCheckUtils]: 6: Hoare triple {62#true} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {62#true} is VALID [2018-11-18 22:04:07,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {62#true} ~len := #in~len;~data := #in~data; {62#true} is VALID [2018-11-18 22:04:07,184 INFO L256 TraceCheckUtils]: 8: Hoare triple {62#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {62#true} is VALID [2018-11-18 22:04:07,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {62#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; {62#true} is VALID [2018-11-18 22:04:07,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {62#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {62#true} is VALID [2018-11-18 22:04:07,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {62#true} is VALID [2018-11-18 22:04:07,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {62#true} assume true; {62#true} is VALID [2018-11-18 22:04:07,186 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {62#true} {62#true} #138#return; {62#true} is VALID [2018-11-18 22:04:07,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {62#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {62#true} is VALID [2018-11-18 22:04:07,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {62#true} assume !true; {63#false} is VALID [2018-11-18 22:04:07,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {63#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {63#false} is VALID [2018-11-18 22:04:07,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {63#false} assume true; {63#false} is VALID [2018-11-18 22:04:07,202 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {63#false} {62#true} #132#return; {63#false} is VALID [2018-11-18 22:04:07,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {63#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {63#false} is VALID [2018-11-18 22:04:07,203 INFO L256 TraceCheckUtils]: 20: Hoare triple {63#false} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {63#false} is VALID [2018-11-18 22:04:07,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {63#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {63#false} is VALID [2018-11-18 22:04:07,204 INFO L256 TraceCheckUtils]: 22: Hoare triple {63#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {63#false} is VALID [2018-11-18 22:04:07,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {63#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; {63#false} is VALID [2018-11-18 22:04:07,205 INFO L273 TraceCheckUtils]: 24: Hoare triple {63#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {63#false} is VALID [2018-11-18 22:04:07,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {63#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {63#false} is VALID [2018-11-18 22:04:07,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {63#false} assume true; {63#false} is VALID [2018-11-18 22:04:07,205 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {63#false} {63#false} #142#return; {63#false} is VALID [2018-11-18 22:04:07,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {63#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {63#false} is VALID [2018-11-18 22:04:07,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {63#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {63#false} is VALID [2018-11-18 22:04:07,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {63#false} assume true; {63#false} is VALID [2018-11-18 22:04:07,207 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {63#false} {63#false} #134#return; {63#false} is VALID [2018-11-18 22:04:07,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {63#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {63#false} is VALID [2018-11-18 22:04:07,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {63#false} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {63#false} is VALID [2018-11-18 22:04:07,208 INFO L273 TraceCheckUtils]: 34: Hoare triple {63#false} assume !false; {63#false} is VALID [2018-11-18 22:04:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:04:07,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:04:07,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:04:07,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:04:07,231 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-18 22:04:07,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:04:07,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:04:07,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:04:07,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:04:07,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:04:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:04:07,650 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-18 22:04:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:04:08,013 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2018-11-18 22:04:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:04:08,014 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-18 22:04:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:04:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:04:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 130 transitions. [2018-11-18 22:04:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:04:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 130 transitions. [2018-11-18 22:04:08,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 130 transitions. [2018-11-18 22:04:08,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:04:08,479 INFO L225 Difference]: With dead ends: 104 [2018-11-18 22:04:08,479 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 22:04:08,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:04:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 22:04:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 22:04:08,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:04:08,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-18 22:04:08,558 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-18 22:04:08,559 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-18 22:04:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:04:08,565 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-18 22:04:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-18 22:04:08,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:04:08,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:04:08,567 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-18 22:04:08,567 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-18 22:04:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:04:08,573 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-18 22:04:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-18 22:04:08,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:04:08,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:04:08,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:04:08,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:04:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:04:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-18 22:04:08,581 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 35 [2018-11-18 22:04:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:04:08,582 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 22:04:08,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:04:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-18 22:04:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 22:04:08,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:04:08,585 INFO L375 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-18 22:04:08,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:04:08,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:04:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1636852463, now seen corresponding path program 1 times [2018-11-18 22:04:08,587 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:04:08,587 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-18 22:04:08,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:04:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:08,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:04:09,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-18 22:04:09,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {450#true} is VALID [2018-11-18 22:04:09,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-18 22:04:09,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #144#return; {450#true} is VALID [2018-11-18 22:04:09,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret24 := main(); {450#true} is VALID [2018-11-18 22:04:09,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {450#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:04:09,133 INFO L256 TraceCheckUtils]: 6: Hoare triple {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {450#true} is VALID [2018-11-18 22:04:09,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {450#true} ~len := #in~len;~data := #in~data; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:04:09,141 INFO L256 TraceCheckUtils]: 8: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {450#true} is VALID [2018-11-18 22:04:09,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#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; {450#true} is VALID [2018-11-18 22:04:09,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {450#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {450#true} is VALID [2018-11-18 22:04:09,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {450#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {450#true} is VALID [2018-11-18 22:04:09,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-18 22:04:09,143 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {450#true} {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #138#return; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:04:09,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:04:09,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume true; {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-18 22:04:09,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {477#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:04:09,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:04:09,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-18 22:04:09,155 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {505#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #132#return; {451#false} is VALID [2018-11-18 22:04:09,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {451#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {451#false} is VALID [2018-11-18 22:04:09,156 INFO L256 TraceCheckUtils]: 21: Hoare triple {451#false} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {451#false} is VALID [2018-11-18 22:04:09,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {451#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {451#false} is VALID [2018-11-18 22:04:09,157 INFO L256 TraceCheckUtils]: 23: Hoare triple {451#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {451#false} is VALID [2018-11-18 22:04:09,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {451#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; {451#false} is VALID [2018-11-18 22:04:09,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {451#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {451#false} is VALID [2018-11-18 22:04:09,158 INFO L273 TraceCheckUtils]: 26: Hoare triple {451#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {451#false} is VALID [2018-11-18 22:04:09,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {451#false} assume true; {451#false} is VALID [2018-11-18 22:04:09,159 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {451#false} {451#false} #142#return; {451#false} is VALID [2018-11-18 22:04:09,159 INFO L273 TraceCheckUtils]: 29: Hoare triple {451#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {451#false} is VALID [2018-11-18 22:04:09,159 INFO L273 TraceCheckUtils]: 30: Hoare triple {451#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {451#false} is VALID [2018-11-18 22:04:09,159 INFO L273 TraceCheckUtils]: 31: Hoare triple {451#false} assume true; {451#false} is VALID [2018-11-18 22:04:09,160 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {451#false} {451#false} #134#return; {451#false} is VALID [2018-11-18 22:04:09,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {451#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {451#false} is VALID [2018-11-18 22:04:09,160 INFO L273 TraceCheckUtils]: 34: Hoare triple {451#false} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {451#false} is VALID [2018-11-18 22:04:09,161 INFO L273 TraceCheckUtils]: 35: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-18 22:04:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:04:09,164 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:04:09,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:04:09,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:04:09,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-18 22:04:09,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:04:09,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:04:09,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:04:09,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:04:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:04:09,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:04:09,293 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2018-11-18 22:04:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:04:10,108 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-11-18 22:04:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:04:10,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-18 22:04:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:04:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:04:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-18 22:04:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:04:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2018-11-18 22:04:10,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2018-11-18 22:04:10,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:04:10,314 INFO L225 Difference]: With dead ends: 76 [2018-11-18 22:04:10,315 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 22:04:10,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-18 22:04:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 22:04:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-18 22:04:10,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:04:10,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-18 22:04:10,348 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-18 22:04:10,348 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-18 22:04:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:04:10,352 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-18 22:04:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-18 22:04:10,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:04:10,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:04:10,353 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-18 22:04:10,353 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-18 22:04:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:04:10,357 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-18 22:04:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-18 22:04:10,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:04:10,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:04:10,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:04:10,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:04:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:04:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-18 22:04:10,363 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 36 [2018-11-18 22:04:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:04:10,363 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-18 22:04:10,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:04:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-18 22:04:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 22:04:10,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:04:10,365 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1] [2018-11-18 22:04:10,366 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:04:10,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:04:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 609633090, now seen corresponding path program 1 times [2018-11-18 22:04:10,366 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:04:10,367 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-18 22:04:10,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:04:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:04:10,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:04:10,779 INFO L477 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-18 22:04:10,789 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:04:10,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:10,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:10,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:10,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-18 22:04:10,833 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:11,195 INFO L477 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 13 treesize of output 10 [2018-11-18 22:04:11,228 INFO L477 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 10 treesize of output 9 [2018-11-18 22:04:11,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:11,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:11,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:11,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-18 22:04:11,801 INFO L477 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 27 treesize of output 20 [2018-11-18 22:04:11,826 INFO L477 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-18 22:04:11,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:12,050 INFO L477 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 19 treesize of output 31 [2018-11-18 22:04:12,072 INFO L477 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 20 treesize of output 19 [2018-11-18 22:04:12,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:12,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:12,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:12,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:12,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:96 [2018-11-18 22:04:14,513 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:14,834 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 22:04:15,275 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-18 22:04:15,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:15,333 INFO L477 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 68 treesize of output 51 [2018-11-18 22:04:15,350 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-18 22:04:15,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:15,391 INFO L477 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 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-18 22:04:15,406 INFO L477 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 14 treesize of output 11 [2018-11-18 22:04:15,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:15,456 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:15,458 INFO L477 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 19 [2018-11-18 22:04:15,470 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 22:04:15,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:15,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:15,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:15,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:15,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:15,524 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:112, output treesize:30 [2018-11-18 22:04:17,752 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:17,911 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-18 22:04:17,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:17,921 INFO L477 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 17 treesize of output 13 [2018-11-18 22:04:17,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:17,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:17,952 INFO L477 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-18 22:04:17,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:17,968 INFO L477 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-18 22:04:17,973 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 22:04:17,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:17,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:18,013 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-18 22:04:18,014 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:44, output treesize:9 [2018-11-18 22:04:18,026 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:18,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2018-11-18 22:04:18,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {821#true} is VALID [2018-11-18 22:04:18,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-18 22:04:18,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #144#return; {821#true} is VALID [2018-11-18 22:04:18,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret24 := main(); {821#true} is VALID [2018-11-18 22:04:18,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {821#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {841#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:04:18,114 INFO L256 TraceCheckUtils]: 6: Hoare triple {841#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {821#true} is VALID [2018-11-18 22:04:18,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#true} ~len := #in~len;~data := #in~data; {821#true} is VALID [2018-11-18 22:04:18,114 INFO L256 TraceCheckUtils]: 8: Hoare triple {821#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {821#true} is VALID [2018-11-18 22:04:18,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#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; {821#true} is VALID [2018-11-18 22:04:18,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {821#true} is VALID [2018-11-18 22:04:18,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {821#true} is VALID [2018-11-18 22:04:18,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-18 22:04:18,115 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {821#true} {821#true} #138#return; {821#true} is VALID [2018-11-18 22:04:18,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {821#true} is VALID [2018-11-18 22:04:18,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-18 22:04:18,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {821#true} assume !!~bvsgt32(~len, 1bv32); {821#true} is VALID [2018-11-18 22:04:18,117 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {821#true} is VALID [2018-11-18 22:04:18,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#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; {881#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:04:18,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {881#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {881#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:04:18,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {881#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {888#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:04:18,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {888#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {888#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:04:18,123 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {888#(not (= (_ bv0 32) |node_create_#res.base|))} {821#true} #140#return; {895#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} is VALID [2018-11-18 22:04:18,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {895#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} ~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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:04:18,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume true; {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:04:18,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 1bv32); {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:04:18,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-18 22:04:18,127 INFO L273 TraceCheckUtils]: 27: Hoare triple {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} assume true; {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-18 22:04:18,129 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} {841#(= |main_~#s~0.offset| (_ bv0 32))} #132#return; {916#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:04:18,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {916#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {920#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:04:18,132 INFO L256 TraceCheckUtils]: 30: Hoare triple {920#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-18 22:04:18,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:04:18,139 INFO L256 TraceCheckUtils]: 32: Hoare triple {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-18 22:04:18,140 INFO L273 TraceCheckUtils]: 33: Hoare triple {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~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; {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:04:18,140 INFO L273 TraceCheckUtils]: 34: Hoare triple {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:04:18,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:04:18,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:04:18,150 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #142#return; {949#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:04:18,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {949#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {953#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:04:18,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {953#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-18 22:04:18,163 INFO L273 TraceCheckUtils]: 40: Hoare triple {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} assume true; {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-18 22:04:18,167 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} {920#(and (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #134#return; {964#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 22:04:18,169 INFO L273 TraceCheckUtils]: 42: Hoare triple {964#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {968#(and (= |main_#t~mem17| main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:04:18,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {968#(and (= |main_#t~mem17| main_~uneq~0) (= (bvadd main_~uneq~0 (_ bv4294967291 32)) (_ bv0 32)))} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {822#false} is VALID [2018-11-18 22:04:18,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {822#false} assume !false; {822#false} is VALID [2018-11-18 22:04:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 22:04:18,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:04:18,722 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 22:04:18,831 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:04:20,688 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 71 [2018-11-18 22:04:21,293 WARN L180 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 22:04:22,433 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 22:04:23,217 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-18 22:04:27,781 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-18 22:04:27,908 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:27,909 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:122, output treesize:1 [2018-11-18 22:04:30,596 INFO L477 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 65 treesize of output 59 [2018-11-18 22:04:31,083 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 22:04:31,093 INFO L477 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 9 treesize of output 8 [2018-11-18 22:04:31,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:31,196 INFO L477 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 17 treesize of output 15 [2018-11-18 22:04:31,204 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 22:04:31,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:31,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:31,289 INFO L477 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 50 treesize of output 54 [2018-11-18 22:04:31,306 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-18 22:04:31,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:31,383 INFO L477 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 43 treesize of output 41 [2018-11-18 22:04:31,387 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:04:31,506 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2018-11-18 22:04:31,513 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 22:04:31,595 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 22:04:31,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-18 22:04:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-18 22:04:32,025 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:70, output treesize:235 [2018-11-18 22:04:32,140 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:40,993 WARN L180 SmtUtils]: Spent 8.50 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 22:04:54,104 WARN L180 SmtUtils]: Spent 12.53 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 22:04:54,376 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 22:04:54,496 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:04:57,463 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 152 [2018-11-18 22:04:57,488 INFO L477 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 95 treesize of output 33 [2018-11-18 22:04:57,498 INFO L477 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 7 treesize of output 3 [2018-11-18 22:04:57,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,536 INFO L477 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 155 treesize of output 93 [2018-11-18 22:04:57,551 INFO L477 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 7 treesize of output 3 [2018-11-18 22:04:57,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,607 INFO L477 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 95 treesize of output 33 [2018-11-18 22:04:57,617 INFO L477 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 7 treesize of output 3 [2018-11-18 22:04:57,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,649 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:00,759 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:00,767 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:00,769 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:00,792 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:00,802 INFO L477 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 155 treesize of output 93 [2018-11-18 22:05:00,813 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:00,815 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:00,858 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:05,018 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:05,027 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:05,029 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:05,048 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:05,056 INFO L477 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 155 treesize of output 93 [2018-11-18 22:05:05,068 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:05,075 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:05,121 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:07,977 INFO L477 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 147 treesize of output 85 [2018-11-18 22:05:07,989 INFO L477 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 5 treesize of output 3 [2018-11-18 22:05:07,997 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:08,022 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:10,315 INFO L477 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 155 treesize of output 93 [2018-11-18 22:05:10,328 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:10,330 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:10,368 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:10,375 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:10,415 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:10,417 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:10,438 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:12,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 5 dim-2 vars, End of recursive call: 14 dim-0 vars, and 14 xjuncts. [2018-11-18 22:05:12,535 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 14 variables, input treesize:493, output treesize:635 [2018-11-18 22:05:15,016 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:16,315 WARN L180 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 44 [2018-11-18 22:05:16,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:05:16,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:05:16,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:16,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:16,494 INFO L477 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-18 22:05:16,502 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:05:16,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:16,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:16,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:16,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 22:05:16,534 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:16,717 INFO L477 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 13 treesize of output 10 [2018-11-18 22:05:16,724 INFO L477 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 10 treesize of output 9 [2018-11-18 22:05:16,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:16,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:16,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:16,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-18 22:05:17,060 INFO L477 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 27 treesize of output 20 [2018-11-18 22:05:17,090 INFO L477 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-18 22:05:17,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:17,339 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-11-18 22:05:17,369 INFO L477 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 19 treesize of output 31 [2018-11-18 22:05:17,392 INFO L477 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 20 treesize of output 19 [2018-11-18 22:05:17,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:17,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:17,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:17,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:17,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:96 [2018-11-18 22:05:19,957 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:20,298 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-11-18 22:05:20,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:20,325 INFO L477 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 68 treesize of output 51 [2018-11-18 22:05:20,348 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-18 22:05:20,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,400 INFO L477 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 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-18 22:05:20,415 INFO L477 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 14 treesize of output 11 [2018-11-18 22:05:20,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,440 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:20,441 INFO L477 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 19 [2018-11-18 22:05:20,453 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 22:05:20,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,496 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:107, output treesize:25 [2018-11-18 22:05:22,626 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:22,781 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-18 22:05:22,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:05:22,796 INFO L477 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 17 treesize of output 13 [2018-11-18 22:05:22,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:22,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:22,820 INFO L477 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-18 22:05:22,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:22,834 INFO L477 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-18 22:05:22,839 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 22:05:22,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:22,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:22,844 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-18 22:05:22,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:3 [2018-11-18 22:05:22,851 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:22,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2018-11-18 22:05:22,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {821#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {821#true} is VALID [2018-11-18 22:05:22,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-18 22:05:22,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #144#return; {821#true} is VALID [2018-11-18 22:05:22,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret24 := main(); {821#true} is VALID [2018-11-18 22:05:22,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {821#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {841#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:05:22,869 INFO L256 TraceCheckUtils]: 6: Hoare triple {841#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {821#true} is VALID [2018-11-18 22:05:22,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#true} ~len := #in~len;~data := #in~data; {821#true} is VALID [2018-11-18 22:05:22,869 INFO L256 TraceCheckUtils]: 8: Hoare triple {821#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {821#true} is VALID [2018-11-18 22:05:22,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#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; {821#true} is VALID [2018-11-18 22:05:22,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {821#true} is VALID [2018-11-18 22:05:22,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {821#true} is VALID [2018-11-18 22:05:22,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-18 22:05:22,871 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {821#true} {821#true} #138#return; {821#true} is VALID [2018-11-18 22:05:22,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {821#true} is VALID [2018-11-18 22:05:22,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#true} assume true; {821#true} is VALID [2018-11-18 22:05:22,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {821#true} assume !!~bvsgt32(~len, 1bv32); {821#true} is VALID [2018-11-18 22:05:22,871 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {821#true} is VALID [2018-11-18 22:05:22,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#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; {881#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:05:22,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {881#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {881#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:05:22,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {881#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {888#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:05:22,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {888#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {888#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:05:22,876 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {888#(not (= (_ bv0 32) |node_create_#res.base|))} {821#true} #140#return; {895#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} is VALID [2018-11-18 22:05:22,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {895#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} ~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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:05:22,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume true; {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:05:22,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 1bv32); {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:05:22,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {899#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-18 22:05:22,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} assume true; {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-18 22:05:22,881 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {909#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} {841#(= |main_~#s~0.offset| (_ bv0 32))} #132#return; {916#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:05:22,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {916#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {1095#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:05:22,884 INFO L256 TraceCheckUtils]: 30: Hoare triple {1095#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-18 22:05:22,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:05:22,885 INFO L256 TraceCheckUtils]: 32: Hoare triple {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-18 22:05:22,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {924#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~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; {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:05:22,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:05:22,888 INFO L273 TraceCheckUtils]: 35: Hoare triple {935#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:05:22,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:05:22,893 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {942#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {928#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #142#return; {949#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:05:22,894 INFO L273 TraceCheckUtils]: 38: Hoare triple {949#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {953#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:05:22,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {953#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-18 22:05:22,900 INFO L273 TraceCheckUtils]: 40: Hoare triple {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} assume true; {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-18 22:05:22,904 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {957#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} {1095#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #134#return; {1132#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-18 22:05:22,906 INFO L273 TraceCheckUtils]: 42: Hoare triple {1132#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~uneq~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {978#(= |main_#t~mem17| main_~uneq~0)} is VALID [2018-11-18 22:05:22,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {978#(= |main_#t~mem17| main_~uneq~0)} assume ~uneq~0 != #t~mem17;havoc #t~mem17; {822#false} is VALID [2018-11-18 22:05:22,906 INFO L273 TraceCheckUtils]: 44: Hoare triple {822#false} assume !false; {822#false} is VALID [2018-11-18 22:05:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 22:05:22,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:05:23,204 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:05:23,314 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 22:05:26,347 WARN L180 SmtUtils]: Spent 3.01 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 22:05:27,222 WARN L180 SmtUtils]: Spent 868.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 22:05:28,218 WARN L180 SmtUtils]: Spent 993.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 22:05:29,457 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-18 22:05:34,098 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-18 22:05:34,177 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:34,177 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:122, output treesize:1 [2018-11-18 22:05:36,755 INFO L477 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 65 treesize of output 59 [2018-11-18 22:05:37,155 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 22:05:37,163 INFO L477 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 9 treesize of output 8 [2018-11-18 22:05:37,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:37,270 INFO L477 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 17 treesize of output 15 [2018-11-18 22:05:37,277 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-18 22:05:37,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:37,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:37,358 INFO L477 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 50 treesize of output 54 [2018-11-18 22:05:37,372 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-18 22:05:37,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:37,507 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2018-11-18 22:05:37,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 22:05:37,605 INFO L477 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 43 treesize of output 41 [2018-11-18 22:05:37,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:05:37,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 22:05:37,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-18 22:05:38,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-18 22:05:38,100 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:70, output treesize:235 [2018-11-18 22:05:38,414 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:05:40,353 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 22:05:43,490 WARN L180 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 152 [2018-11-18 22:05:43,520 INFO L477 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 155 treesize of output 93 [2018-11-18 22:05:43,539 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:43,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:43,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:43,621 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:43,630 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:43,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:43,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:43,672 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:43,680 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:43,685 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:43,710 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:47,918 INFO L477 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 147 treesize of output 85 [2018-11-18 22:05:47,930 INFO L477 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 5 treesize of output 3 [2018-11-18 22:05:47,932 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:47,964 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:51,070 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:51,077 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:51,079 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:51,097 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:51,119 INFO L477 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 155 treesize of output 93 [2018-11-18 22:05:51,156 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:51,159 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:51,238 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:54,598 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:54,609 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:54,610 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:54,628 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:54,635 INFO L477 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 155 treesize of output 93 [2018-11-18 22:05:54,645 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:54,647 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:54,681 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:57,808 INFO L477 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 95 treesize of output 33 [2018-11-18 22:05:57,822 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:57,837 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:57,860 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:57,873 INFO L477 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 155 treesize of output 93 [2018-11-18 22:05:57,881 INFO L477 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 7 treesize of output 3 [2018-11-18 22:05:57,883 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:57,926 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:00,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 5 dim-2 vars, End of recursive call: 14 dim-0 vars, and 14 xjuncts. [2018-11-18 22:06:00,227 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 14 variables, input treesize:493, output treesize:635 [2018-11-18 22:06:02,683 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:06:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 22 [2018-11-18 22:06:03,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-11-18 22:06:03,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:06:03,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:06:03,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:06:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:06:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:06:03,647 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 22 states. [2018-11-18 22:06:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:13,064 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-18 22:06:13,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:06:13,064 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-11-18 22:06:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:06:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:06:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2018-11-18 22:06:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:06:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2018-11-18 22:06:13,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2018-11-18 22:06:13,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:13,228 INFO L225 Difference]: With dead ends: 60 [2018-11-18 22:06:13,228 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 22:06:13,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:06:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 22:06:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-11-18 22:06:13,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:06:13,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 49 states. [2018-11-18 22:06:13,528 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 49 states. [2018-11-18 22:06:13,528 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 49 states. [2018-11-18 22:06:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:13,535 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-18 22:06:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-18 22:06:13,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:13,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:13,537 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 58 states. [2018-11-18 22:06:13,542 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 58 states. [2018-11-18 22:06:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:13,548 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-18 22:06:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-18 22:06:13,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:13,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:13,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:06:13,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:06:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 22:06:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-18 22:06:13,557 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 45 [2018-11-18 22:06:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:06:13,561 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 22:06:13,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:06:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 22:06:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:06:13,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:06:13,563 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-11-18 22:06:13,563 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:06:13,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:06:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1741885821, now seen corresponding path program 1 times [2018-11-18 22:06:13,567 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:06:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:06:13,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:06:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:13,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:06:13,852 INFO L477 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-18 22:06:13,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:13,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:13,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:06:13,866 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:14,885 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| sll_circular_create_~head~0.base)) (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~head~0.base (_ bv1 1))))) is different from true [2018-11-18 22:06:17,006 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:06:19,061 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:06:21,133 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:06:21,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:21,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:21,426 INFO L477 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-18 22:06:21,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-18 22:06:21,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:21,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:21,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:21,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-18 22:06:23,555 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:23,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-11-18 22:06:23,737 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:06:23,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:23,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:23,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:23,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-11-18 22:06:23,782 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:28,070 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 22:06:30,192 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:06:30,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {1441#true} call ULTIMATE.init(); {1441#true} is VALID [2018-11-18 22:06:30,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {1441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1441#true} is VALID [2018-11-18 22:06:30,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {1441#true} assume true; {1441#true} is VALID [2018-11-18 22:06:30,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1441#true} {1441#true} #144#return; {1441#true} is VALID [2018-11-18 22:06:30,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {1441#true} call #t~ret24 := main(); {1441#true} is VALID [2018-11-18 22:06:30,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {1441#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1461#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:06:30,491 INFO L256 TraceCheckUtils]: 6: Hoare triple {1461#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:30,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {1465#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:30,493 INFO L256 TraceCheckUtils]: 8: Hoare triple {1465#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:30,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {1465#(= |#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; {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:30,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:30,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:06:30,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:06:30,499 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1465#(= |#valid| |old(#valid)|)} #138#return; {1489#(and (= (_ bv0 1) (select |old(#valid)| |sll_circular_create_#t~ret3.base|)) (= |#valid| (store |old(#valid)| |sll_circular_create_#t~ret3.base| (_ bv1 1))))} is VALID [2018-11-18 22:06:30,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {1489#(and (= (_ bv0 1) (select |old(#valid)| |sll_circular_create_#t~ret3.base|)) (= |#valid| (store |old(#valid)| |sll_circular_create_#t~ret3.base| (_ bv1 1))))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1493#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} is VALID [2018-11-18 22:06:30,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {1493#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} assume true; {1493#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} is VALID [2018-11-18 22:06:30,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {1493#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} assume !!~bvsgt32(~len, 1bv32); {1493#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} is VALID [2018-11-18 22:06:30,504 INFO L256 TraceCheckUtils]: 17: Hoare triple {1493#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:30,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(= |#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; {1506#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:30,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {1506#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1506#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:30,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {1506#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1513#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-18 22:06:30,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {1513#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {1513#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-18 22:06:30,510 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1513#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} {1493#(exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))} #140#return; {1520#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1))))))} is VALID [2018-11-18 22:06:30,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {1520#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| sll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)) |sll_circular_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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1524#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-18 22:06:30,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {1524#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} assume true; {1524#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-18 22:06:30,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {1524#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} assume !~bvsgt32(~len, 1bv32); {1524#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-18 22:06:30,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {1524#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1534#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-18 22:06:30,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {1534#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} assume true; {1534#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} is VALID [2018-11-18 22:06:30,525 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1534#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((v_subst_1 (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| v_subst_1 (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| v_subst_1)))))} {1461#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #132#return; {1541#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)))} is VALID [2018-11-18 22:06:30,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {1541#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {1545#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:06:30,528 INFO L256 TraceCheckUtils]: 30: Hoare triple {1545#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:06:30,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1553#(and (= |#valid| |old(#valid)|) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:06:30,531 INFO L256 TraceCheckUtils]: 32: Hoare triple {1553#(and (= |#valid| |old(#valid)|) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:06:30,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~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; {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:30,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:30,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1567#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:06:30,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {1567#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1567#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:06:30,547 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1567#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1553#(and (= |#valid| |old(#valid)|) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #142#return; {1574#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|)) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (select |old(#valid)| |sll_circular_prepend_#t~ret8.base|) (_ bv0 1)) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:06:30,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {1574#(and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|)) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (select |old(#valid)| |sll_circular_prepend_#t~ret8.base|) (_ bv0 1)) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1578#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#t~mem9.base| (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} is VALID [2018-11-18 22:06:30,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {1578#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#t~mem9.base| (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} is VALID [2018-11-18 22:06:30,558 INFO L273 TraceCheckUtils]: 40: Hoare triple {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} assume true; {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} is VALID [2018-11-18 22:06:30,561 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} {1545#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (and (not (= |main_~#s~0.base| v_subst_1)) (= (bvadd (select |#valid| v_subst_1) (_ bv1 1)) (_ bv0 1)))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #134#return; {1442#false} is VALID [2018-11-18 22:06:30,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {1442#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1442#false} is VALID [2018-11-18 22:06:30,561 INFO L273 TraceCheckUtils]: 43: Hoare triple {1442#false} assume !(~uneq~0 != #t~mem17);havoc #t~mem17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~ptr~0.base, ~ptr~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 1bv32; {1442#false} is VALID [2018-11-18 22:06:30,561 INFO L273 TraceCheckUtils]: 44: Hoare triple {1442#false} assume true;call #t~mem20 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1442#false} is VALID [2018-11-18 22:06:30,562 INFO L273 TraceCheckUtils]: 45: Hoare triple {1442#false} assume ~data~0 != #t~mem20;havoc #t~mem20; {1442#false} is VALID [2018-11-18 22:06:30,562 INFO L273 TraceCheckUtils]: 46: Hoare triple {1442#false} assume !false; {1442#false} is VALID [2018-11-18 22:06:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-18 22:06:30,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:06:30,730 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 22:06:31,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:06:31,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:06:31,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:06:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:31,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:06:31,359 INFO L477 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-18 22:06:31,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:31,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:31,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 22:06:31,378 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:33,469 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |c_old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))) is different from true [2018-11-18 22:06:37,749 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:06:40,011 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:06:40,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:40,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:40,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:40,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 22:06:40,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-11-18 22:06:40,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:40,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:40,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:40,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-11-18 22:06:40,254 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:40,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:06:40,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-18 22:06:40,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:40,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:40,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:40,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:49 [2018-11-18 22:06:40,469 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:42,633 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) node_create_~temp~0.offset (_ bv0 32))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)))) is different from true [2018-11-18 22:06:46,853 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 22:06:47,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {1441#true} call ULTIMATE.init(); {1441#true} is VALID [2018-11-18 22:06:47,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {1441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1441#true} is VALID [2018-11-18 22:06:47,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {1441#true} assume true; {1441#true} is VALID [2018-11-18 22:06:47,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1441#true} {1441#true} #144#return; {1441#true} is VALID [2018-11-18 22:06:47,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {1441#true} call #t~ret24 := main(); {1441#true} is VALID [2018-11-18 22:06:47,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {1441#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1638#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-18 22:06:47,017 INFO L256 TraceCheckUtils]: 6: Hoare triple {1638#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:47,018 INFO L273 TraceCheckUtils]: 7: Hoare triple {1465#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:47,019 INFO L256 TraceCheckUtils]: 8: Hoare triple {1465#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:47,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {1465#(= |#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; {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:47,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:47,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {1475#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:06:47,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:06:47,025 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1482#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {1465#(= |#valid| |old(#valid)|)} #138#return; {1489#(and (= (_ bv0 1) (select |old(#valid)| |sll_circular_create_#t~ret3.base|)) (= |#valid| (store |old(#valid)| |sll_circular_create_#t~ret3.base| (_ bv1 1))))} is VALID [2018-11-18 22:06:47,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {1489#(and (= (_ bv0 1) (select |old(#valid)| |sll_circular_create_#t~ret3.base|)) (= |#valid| (store |old(#valid)| |sll_circular_create_#t~ret3.base| (_ bv1 1))))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1666#(exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))} is VALID [2018-11-18 22:06:47,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {1666#(exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))} assume true; {1666#(exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))} is VALID [2018-11-18 22:06:47,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {1666#(exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))} assume !!~bvsgt32(~len, 1bv32); {1666#(exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))} is VALID [2018-11-18 22:06:47,029 INFO L256 TraceCheckUtils]: 17: Hoare triple {1666#(exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1465#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:47,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {1465#(= |#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; {1679#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:47,032 INFO L273 TraceCheckUtils]: 19: Hoare triple {1679#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1679#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:47,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {1679#(and (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)) (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1686#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-18 22:06:47,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {1686#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {1686#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-18 22:06:47,038 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1686#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (not (= (_ bv0 32) |node_create_#res.base|)))} {1666#(exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1))))} #140#return; {1693#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#t~ret4.base|)) (= (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1)) |#valid|) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} is VALID [2018-11-18 22:06:47,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {1693#(and (not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|)) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#t~ret4.base|)) (= (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#t~ret4.base| (_ bv1 1)) |#valid|) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1697#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} is VALID [2018-11-18 22:06:47,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {1697#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} assume true; {1697#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} is VALID [2018-11-18 22:06:47,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {1697#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} assume !~bvsgt32(~len, 1bv32); {1697#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} is VALID [2018-11-18 22:06:47,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {1697#(and (not (= sll_circular_create_~head~0.base (_ bv0 32))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) sll_circular_create_~head~0.base)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1707#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base|)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} is VALID [2018-11-18 22:06:47,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {1707#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base|)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} assume true; {1707#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base|)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} is VALID [2018-11-18 22:06:47,052 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1707#(and (not (= (_ bv0 32) |sll_circular_create_#res.base|)) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base| (_ bv1 1))) (= (_ bv0 1) (select (store |old(#valid)| sll_circular_create_~last~0.base (_ bv1 1)) |sll_circular_create_#res.base|)) (= (select |old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))))} {1638#(= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1))} #132#return; {1714#(and (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (not (= |main_~#s~0.base| sll_circular_create_~last~0.base)) (not (= sll_circular_create_~last~0.base |main_#t~ret15.base|)) (= (_ bv1 1) (select |#valid| sll_circular_create_~last~0.base)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)) (not (= |main_~#s~0.base| |main_#t~ret15.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))))} is VALID [2018-11-18 22:06:47,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {1714#(and (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (not (= |main_~#s~0.base| sll_circular_create_~last~0.base)) (not (= sll_circular_create_~last~0.base |main_#t~ret15.base|)) (= (_ bv1 1) (select |#valid| sll_circular_create_~last~0.base)))) (not (= (_ bv0 32) |main_#t~ret15.base|)) (= (_ bv1 1) (select |#valid| |main_#t~ret15.base|)) (not (= |main_~#s~0.base| |main_#t~ret15.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset;~uneq~0 := 5bv32; {1718#(and (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (not (= sll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| sll_circular_create_~last~0.base)) (= (_ bv1 1) (select |#valid| sll_circular_create_~last~0.base)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:06:47,055 INFO L256 TraceCheckUtils]: 30: Hoare triple {1718#(and (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (not (= sll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| sll_circular_create_~last~0.base)) (= (_ bv1 1) (select |#valid| sll_circular_create_~last~0.base)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~uneq~0); {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:06:47,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1553#(and (= |#valid| |old(#valid)|) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:06:47,056 INFO L256 TraceCheckUtils]: 32: Hoare triple {1553#(and (= |#valid| |old(#valid)|) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:06:47,058 INFO L273 TraceCheckUtils]: 33: Hoare triple {1549#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~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; {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:47,058 INFO L273 TraceCheckUtils]: 34: Hoare triple {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:47,061 INFO L273 TraceCheckUtils]: 35: Hoare triple {1560#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1737#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-18 22:06:47,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {1737#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume true; {1737#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-18 22:06:47,065 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1737#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} {1553#(and (= |#valid| |old(#valid)|) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #142#return; {1744#(and (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-18 22:06:47,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {1744#(and (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) node_create_~temp~0.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1578#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#t~mem9.base| (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} is VALID [2018-11-18 22:06:47,071 INFO L273 TraceCheckUtils]: 39: Hoare triple {1578#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#t~mem9.base| (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} is VALID [2018-11-18 22:06:47,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} assume true; {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} is VALID [2018-11-18 22:06:47,074 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1582#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) node_create_~temp~0.offset (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| sll_circular_prepend_~new_head~1.base))))} {1718#(and (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (not (= sll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| sll_circular_create_~last~0.base)) (= (_ bv1 1) (select |#valid| sll_circular_create_~last~0.base)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #134#return; {1442#false} is VALID [2018-11-18 22:06:47,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {1442#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;call #t~mem17 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1442#false} is VALID [2018-11-18 22:06:47,075 INFO L273 TraceCheckUtils]: 43: Hoare triple {1442#false} assume !(~uneq~0 != #t~mem17);havoc #t~mem17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~ptr~0.base, ~ptr~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 1bv32; {1442#false} is VALID [2018-11-18 22:06:47,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {1442#false} assume true;call #t~mem20 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {1442#false} is VALID [2018-11-18 22:06:47,075 INFO L273 TraceCheckUtils]: 45: Hoare triple {1442#false} assume ~data~0 != #t~mem20;havoc #t~mem20; {1442#false} is VALID [2018-11-18 22:06:47,075 INFO L273 TraceCheckUtils]: 46: Hoare triple {1442#false} assume !false; {1442#false} is VALID [2018-11-18 22:06:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-11-18 22:06:47,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:06:50,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:06:50,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-11-18 22:06:50,016 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-18 22:06:50,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:06:50,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-18 22:06:50,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:50,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-18 22:06:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-18 22:06:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=850, Unknown=6, NotChecked=180, Total=1122 [2018-11-18 22:06:50,217 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 33 states. [2018-11-18 22:07:29,583 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-11-18 22:07:34,119 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((sll_circular_create_~last~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~last~0.base (_ bv1 1))) (= (select |c_old(#valid)| sll_circular_create_~last~0.base) (_ bv0 1)))) (exists ((sll_circular_create_~head~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| sll_circular_create_~head~0.base)) (= |c_#valid| (store |c_old(#valid)| sll_circular_create_~head~0.base (_ bv1 1)))))) is different from true